Graph explorer

Norm hypergraphs

We introduce a high uniformity generalization of the so-called (projective) norm graphs of Alon, Kollár, Rónyai, and Szabó, and use it to show that $$\operatorname{ex}_{d}(n,K_{s_{1},\ldots,s_{d}}^{(d)}) = Θ\left(n^{d - \frac{1}{s_{1}\ldots s_{d-1}}}\right)$$ holds for all integers $s_{1},\ldots,s_{d} \geq 2$ such that $s_{d} \geq \left((d-1)(s_{1}\ldots s_{d-1}-1)\right)!+1$. This improves upon a recent result of Ma, Yuan and Zhang, and thus settles (many) new cases of a conjecture of Mubayi.

4 nodes3 linksoverview previewNorm hypergraphs
4 nodes3 links
Norm hypergraphs4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWNorm hypergraphspreprint / 2021ACosmin PohoataResearcherADmitriy ZakharovResearcherTmath.CO8936 works
PaperSignal 103 links

Norm hypergraphs

preprint / 2021

Open