Hypergraphs with vanishing Tur\'an density in uniformly dense hypergraphs
Combinatorics
2019-01-30 v3
Abstract
P. Erd\H{o}s [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs that have to appear in any sufficiently large hypergraph of positive density. We study related questions for -uniform hypergraphs with the additional assumption that has to be uniformly dense with respect to vertex sets. In particular, we characterise those hypergraphs that are guaranteed to appear in large uniformly dense hypergraphs of positive density. We also review the case when the density of the induced subhypergraphs of may depend on the proportion of the considered vertex sets.
Cite
@article{arxiv.1706.08873,
title = {Hypergraphs with vanishing Tur\'an density in uniformly dense hypergraphs},
author = {Christian Reiher and Vojtěch Rödl and Mathias Schacht},
journal= {arXiv preprint arXiv:1706.08873},
year = {2019}
}
Comments
26 pages, this version addresses changes arising from the referee reports