← All problems

Turán’s tetrahedron problem

For the tetrahedron K4(3)K_4^{(3)}, determine whether its Turán density satisfies π(K4(3))=59\pi(K_4^{(3)})=\frac{5}{9}. Equivalently, if ex⁡(n,K4(3))\operatorname{ex}(n,K_4^{(3)}) denotes the maximum number of edges in a K4(3)K_4^{(3)}-free 33-uniform hypergraph on nn vertices, determine whether lim⁡n→∞ex⁡(n,K4(3))(n3)=59\lim_{n\to\infty}\frac{\operatorname{ex}(n,K_4^{(3)})}{\binom{n}{3}}=\frac{5}{9}, where π(K4(3))\pi(K_4^{(3)}) is this limiting density.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

A new machine-checked result lowers the best known upper bound, but the conjectured exact answer remains unproved.

Turán’s tetrahedron problem asks whether the ordinary density of tetrahedron-free 33-uniform hypergraphs equals the conjectured value π(K43)=5/9\pi(K_4^3)=5/9. The classical problem remains open.

Known results

  • Baber’s earlier upper bound was approximately 0.56150.5615.

September 23, 2026 upper-bound improvement

This is claimed progress toward 5/95/9, not a proof of the conjectured value.

Current status (as of September 2026): The reported upper bound improves Baber’s bound, but the conjecture π(K43)=5/9\pi(K_4^3)=5/9 remains open.

Sources

Solutions 0

No solutions have been posted yet.