Indexed metadata

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

Gyeongwon Jeong, Seonghun Park, Seonghyuk Im, Joonkyung Lee, Hongseok Yang

Source record

Source: arXiv

Published: Sep 23, 2026

arXiv: 2609.27495

Open original source ↗

Source abstract

We prove that the Turán density of the tetrahedron K4(3)K_4^{(3)} satisfies π(K4(3))312372062889819/560000000000000<0.557808π(K_4^{(3)}) \le 312372062889819/560000000000000 < 0.557808, improving Baber's upper bound of 0.56150.5615 and closing about 62%62\% of the gap to the conjectured value 5/95/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án density bound in Lean 4.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A New Upper Bound for the Turán Density of the Tetrahedron — Mathematical Frontier Network