The Turán density of the tight five-cycle
Version 1 / Nov 21, 2026 / CC BY 4.0
Abstract
The tight five-cycle is the three-uniform hypergraph whose edges are the five cyclically consecutive triples on five distinct vertices. We prove that its Turán density is . This answers the conjecture usually attributed to Mubayi and Rödl, explicitly stated by Mubayi, Pikhurko and Sudakov. Mubayi and Rödl's recursive construction gives the lower bound. The upper bound follows the reduction of Bodnár, León, Liu and Pikhurko, whose theorem concerns forbidding both the tight four-cycle and the tight five-cycle, or a tight cycle of length at least seven not divisible by three. We establish the two estimates needed for the five-cycle alone by exact rational certificates, using weighted link inequalities to include configurations containing a complete four-vertex hypergraph. We give the finite counting argument that turns the certificates into these estimates and then into the density bound. The whole proof, including this counting argument, is checked in Lean; its finite computations run as compiled code, so the check trusts Lean's compiler as well as its kernel. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.
Provenance statement
References
- P. Graham, Checking material for The Turán density of the tight five-cycle (https://doi.org/10.5281/zenodo.23743819), published with the paper (linked below the title). The formalization guide there is the file checks/FORMALIZATION.md . Toolchain: leanprover/lean4:v4.32.2 ; Mathlib revision 905b95818eb32af7874a58b427f50c1711a5e96c (https://github.com/leanprover-community/mathlib4/tree/905b95818eb32af7874a58b427f50c1711a5e96c).DOI
- D. Mubayi and V. Rödl, On the Turán Number of Triple Systems , Journal of Combinatorial Theory, Series A 100 (2002), no. 1, 136--152. Author's copy, Construction 1, p. 13: https://homepages.math.uic.edu/~mubayi/papers/hypturan.pdf.link
- D. Mubayi, O. Pikhurko and B. Sudakov, Hypergraph Turán Problem: Some Open Questions , October 10, 2011, §2.4, Conjecture 7, p. 3. https://rose-kiwi.lnx.warwick.ac.uk/E/MubayiPikhurkoSudakov11aim.pdf.link
- N. Kamčev, S. Letzter and A. Pokrovskiy, The Turán Density of Tight Cycles in Three-Uniform Hypergraphs , International Mathematics Research Notices 2024 (2024), no. 6, 4804--4841. Numbering follows arXiv:2209.08134v3 (October 6, 2023; first posted September 16, 2022). https://arxiv.org/abs/2209.08134v3.arXiv
- L. Bodnár, J. León, X. Liu and O. Pikhurko, The Turán density of short tight cycles , arXiv:2506.03223v1 (first posted June 3, 2025). All numbered references follow the versioned PDF. https://arxiv.org/abs/2506.03223v1.arXiv
- L. Bodnár, J. León, X. Liu and O. Pikhurko, The Turán number of , supplementary notebook, introduction and zero-based code cells 1--6, June 3, 2025. https://github.com/bodnalev/supplementary_files/blob/5766324d010da24a66271c0fbe38460cd377985b/no_cl/no_c5_k4.ipynb.link
- V. Falgas-Ravry and E. R. Vaughan, Turán H-densities for 3-graphs , Electronic Journal of Combinatorics 19 (2012), no. 3, P40. Numbering follows arXiv:1201.4326v1 (first posted January 20, 2012). https://arxiv.org/abs/1201.4326v1.arXiv
- H. Huang, On the maximum induced density of directed stars and related problems , arXiv:1303.3101v2 (March 17, 2013; first posted March 13, 2013). https://arxiv.org/abs/1303.3101v2.arXiv
- G. Jeong, S. Park, J. Hyun, S.-i. Oum and H. Yang, Formalizing Flag Algebras in Lean , arXiv:2607.23500v2 (October 14, 2026; first posted July 26, 2026). https://arxiv.org/abs/2607.23500v2.arXiv
- L. Bodnár, FlagAlgebraToolbox: Flag Algebra Computations in SageMath , arXiv:2601.06590v3 (September 12, 2026; first posted January 10, 2026). This version documents release 0.3; the earlier supplementary notebook BLLPdata does not identify a release tag. https://arxiv.org/abs/2601.06590v3.arXiv
Show all 20 referencesShow fewer references
- G. Jeong, S. Park, S. Im, J. Lee and H. Yang, A New Upper Bound for the Turán Density of the Tetrahedron , arXiv:2609.27495v2 (October 2, 2026; first posted September 23, 2026). https://arxiv.org/abs/2609.27495v2.arXiv
- X. Liu, C53_count.ipynb , edge-density objective and saved output, February 6, 2026, repository revision 1b5c8b15c545ea15587f8240bd2149a29aaba857 . https://github.com/xliu2022/xliu2022.github.io/blob/1b5c8b15c545ea15587f8240bd2149a29aaba857/FlagAlgebra_Certificate/HypergraphGeneralizeTuran/script/C53_count.ipynb.link
- A. Ferudun, An Exact Logarithmic-State Algorithm for Recursive Tight-Cycle Constructions , version 1.0, October 16, 2026. https://doi.org/10.5281/zenodo.23421446.DOI
- Ulam.AI, UnsolvedMath , record AIM-COMBINATORICS-0153 (record id 20001028), research summary on recursive tight-cycle constructions. The record metadata is dated August 14, 2026. Only the pinned dataset record was read, not the underlying attempt or proof. https://huggingface.co/datasets/ulamai/UnsolvedMath/blob/d371ee917ac9647fbb06cd6fc529deec6f3dda82/dataset.json.link
- L. Bodnár, J. León, X. Liu and O. Pikhurko, The Turán density of the tight 5-cycle minus one edge , arXiv:2412.21011v3 (July 9, 2025; first posted December 30, 2024). https://arxiv.org/abs/2412.21011v3.arXiv
- J. Balogh and H. Luo, Turán density of long tight cycle minus one hyperedge , arXiv:2303.10530v2 (March 3, 2024; first posted March 19, 2023). https://arxiv.org/abs/2303.10530v2.arXiv
- B. Lidický, C. Mattes and F. Pfender, The Hypergraph Turán Densities of Tight Cycles Minus an Edge , arXiv:2409.14257v2 (November 26, 2024; first posted September 21, 2024). https://arxiv.org/abs/2409.14257v2.arXiv
- B. Lidický and J. Volec, Solving Large SDPs from Flag Algebra Problems , arXiv:2610.33850v1 (October 24, 2026). https://arxiv.org/abs/2610.33850v1.arXiv
- A. A. Razborov, Flag algebras , Journal of Symbolic Logic 72 (2007), no. 4, 1239--1282. https://doi.org/10.2178/jsl/1203350785.DOI
- A. A. Razborov, On 3-Hypergraphs with Forbidden 4-Vertex Configurations (https://web.archive.org/web/20190917230822id_/http://people.cs.uchicago.edu/~razborov/files/turan.pdf), SIAM J. Discrete Math. 24 (2010), no. 3, 946--963; the bound $\pi(\Cfive)<0.4683$ is on p. 962. https://doi.org/10.1137/090747476.DOI
Version history
- v1 · 9 pagesSubmitted by P. GrahamZenodo archive: https://doi.org/10.5281/zenodo.23743819. The Lean 4 development (folder lean) and the certificate checkers (folder checks) are in the Zenodo archive. Compiled checks the proof relies on: the Lean theorem TightCycleC5.Bridge.mubayi_rodl_checked states, from the definitions, that ex(n, C5)/binom(n,3) tends to 2*sqrt(3)-3 for the tight five-cycle C5. Besides the standard axioms propext, Classical.choice and Quot.sound, it depends on exactly 692 named native_decide facts, evaluated by compiled code, so the check trusts Lean's compiler and runtime as well as its kernel. These facts check finite arithmetic (53 groups of uncolored and 634 colored arithmetic checks), one multiplier quotation identity, two sparse coefficient comparisons and two rational Gram identities; the class covers, arithmetic-range coverage and the other positive-semidefinite matrices (six uncolored, 36 colored) have kernel proofs. Separately, exact-integer Python and C++ checkers (checks/p32 and checks/p33, run by checks/quickcheck.py) re-check the rational certificates behind the paper's two partition estimates, including positivity and class coverage, and reject planted corruptions. checks/FORMALIZATION.md states the trust boundary. License: the paper text is deposited here under CC BY 4.0; the published code, Lean development and data stay under Apache-2.0 in their repository and Zenodo records.CurrentNov 21, 2026