English

Hypergraphs with minimum positive uniform Tur\'an density

Combinatorics 2022-01-17 v2

Abstract

Reiher, R\"odl and Schacht [J. London Math. Soc. 97 (2018), 77--97] showed that the uniform Tur\'an density of every 33-uniform hypergraph is either 00 or at least 1/271/27, and asked whether there exist 33-uniform hypergraphs with uniform Tur\'an density equal or arbitrarily close to 1/271/27. We construct 33-uniform hypergraphs with uniform Tur\'an density equal to 1/271/27.

Keywords

Cite

@article{arxiv.2105.09883,
  title  = {Hypergraphs with minimum positive uniform Tur\'an density},
  author = {Frederik Garbe and Daniel Kral and Ander Lamaison},
  journal= {arXiv preprint arXiv:2105.09883},
  year   = {2022}
}

Comments

22 pages, 9 figures; updated version with several small corrections and an added section with conclusive remarks

R2 v1 2026-06-24T02:18:41.635Z