Answers are grounded in this paper and cite their sources.
The Turán density of an r-uniform hypergraph H, denoted π (H), is the limit of the maximum density of an n-vertex r-uniform hypergraph not containing a copy of H, as n → ∞. Denote by C the $3$-uniform tight cycle on vertices. Mubayi and Rödl gave an “iterated blow-up” construction showing that the Turán density of C₅ is at least 2√3 - 3 ≈ 0.464, and this bound is conjectured to be tight. Their construction also does not contain C for larger not divisible by $3$, which suggests that it might be the extremal construction for these hypergraphs as well. Here, we determine the Turán density of C for all large not divisible by $3$, showing that indeed π (C) = 2√3 - 3. To our knowledge, this is the first example of a Turán density being determined where the extremal construction is an iterated blow-up construction. A key component in our proof, which may be of independent interest, is a $3$-uniform analogue of the statement “a graph is bipartite if and only if it does not contain an odd cycle”.
No takes yet. Share an insight, caveat, or question.
Kamčev et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: