Turán's conjecture for complete 3-uniform hypergraphs

From papers

Let Kk(3)K_k^{(3)} be the complete kk-vertex 33-uniform hypergraph, and let π(Kk(3))\pi(K_k^{(3)}) denote its Turán density.

Turán's conjecture. For any integer k4k\geqslant 4, we have

π(Kk(3))=1(2k1)2.\pi(K_k^{(3)})=1-\left(\frac{2}{k-1}\right)^2.

This is a central open problem in extremal hypergraph theory; the exact Turán density is known only for a few small values of kk.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Mingze Li, Jie Ma and Mingyuan Rong, “Recent advances in arrow relations and traces of sets”, arXiv:2507.23375 (2025).

Additional references

18 papers in this index state this conjecture (2008–2025). The statement above is taken from the most recent of them; the others are arXiv:2507.16622, arXiv:2303.00375, arXiv:2303.00427, arXiv:2209.04894, arXiv:2206.03948, arXiv:2205.08474, arXiv:2107.09233, arXiv:1911.07969, arXiv:1802.03648, arXiv:1709.01590, arXiv:1601.07809, arXiv:1508.01784, and 5 more.

Solutions 0

No solutions have been posted yet.