Hypergraphs with minimum positive uniform Turán density

DOI10.1007/S11856-023-2554-0MaRDI QIDQ6131728zbMATH OpenFDO

Authors

Publication date 18 April 2024

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.09883

Mathematics Subject Classification ID

Enumerative combinatorics (05Axx) Graph theory (05Cxx) Extremal combinatorics (05Dxx)

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

Recommendations

• Uniform Turán density of cycles
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• On the Turán density of uniform hypergraphs
• On Ramsey - Turan type theorems for hypergraphs
• The Turán problem for hypergraphs on fixed size

Cited in

(2)

• The Turán density of tight cycles in three-uniform hypergraphs
• The minimum positive uniform Turán density in uniformly dense k-uniform hypergraphs

This page was built for publication: Hypergraphs with minimum positive uniform Turán density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131728)