Skip to content

A New Upper Bound for the Turán Density of the Tetrahedron

Sep 2026 · arXiv.org · Vol abs/2609.27495 · 2 citations · 31 references
Computer Science Mathematics

Abstract

We prove that the Tur\'an density of the tetrahedron $K_4^{(3)}$ satisfies $\pi(K_4^{(3)}) \le 14993367693127837/26880000000000000<0.557789$, improving Baber's upper bound of $0.5615$ and closing about $62\%$ of the gap to the conjectured value $5/9$. The proof uses an exact seven-vertex flag-algebra certificate incorporating degree-stationarity from Razborov's differential method. To find the certificate, we combine the established techniques of cutting planes and column generation to optimize jointly over flag families whose types have at most five vertices. We give a complete formal proof of this Tur\'an density bound in Lean 4.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.