English

Hypergraphs with uniform Tur\'an density equal to 8/27

Combinatorics 2026-02-25 v2

Abstract

In the 1980s, Erd\H{o}s and S\'os initiated the study of Tur\'an problems with a uniformity condition on the distribution of edges: the uniform Tur\'an density of a hypergraph HH is the infimum over all dd for which any sufficiently large hypergraph with the property that all its linear-size subhypergraphs have density at least dd contains HH. In particular, they asked to determine the uniform Tur\'an densities of K4(3)K_4^{(3)-} and K4(3)K_4^{(3)}. After more than 30 years, the former was solved in [Israel J. Math. 211 (2016), 349-366] and [J. Eur. Math. Soc. 20 (2018), 1139-1159], while the latter still remains open. Till today, there are known constructions of 3-uniform hypergraphs with uniform Tur\'an density equal to 0, 1/27, 4/27 and 1/4 only. We extend this list by a fifth value: we prove an easy to verify condition for the uniform Tur\'an density to be equal to 8/27 and identify hypergraphs satisfying this condition.

Keywords

Cite

@article{arxiv.2407.05829,
  title  = {Hypergraphs with uniform Tur\'an density equal to 8/27},
  author = {Frederik Garbe and Daniel Iľkovič and Daniel Kráľ and Filip Kučerák and Ander Lamaison},
  journal= {arXiv preprint arXiv:2407.05829},
  year   = {2026}
}

Comments

Minor revision. Small corrections and improvements to the text

R2 v1 2026-06-28T17:32:42.608Z