OpenAlex
The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
Work
Year: 2018
Type: article
Abstract: Let \(\mathcal{T}=(V,\mathcal{E})\) be a 3-uniform linear hypertree. We consider a blow-up hypergraph \(\mathcal{B}[\mathcal{T}]\). We are interested in the following problem. We have to decide whethe... more
Cites: 11
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Open Access status: diamond