Tetrahedron Conjecture in the $\ell_2$-norm
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908661610184704 |
|---|---|
| author | Bodnár, Levente Chen, Wanfang Deng, Jinghua Hou, Jianfeng Liu, Xizhi Song, Jialei Yang, Jiabao Zhang, Yixiao |
| author_facet | Bodnár, Levente Chen, Wanfang Deng, Jinghua Hou, Jianfeng Liu, Xizhi Song, Jialei Yang, Jiabao Zhang, Yixiao |
| contents | The famous Tetrahedron Conjecture of Turán from the 1940s asserts that the number of edges in an $n$-vertex $3$-graph without the tetrahedron, the complete $3$-graph on four vertices, cannot exceed that of the balanced complete cyclic $3$-partite $3$-graph, whose edges are of types $V_1 V_2 V_3$, $V_1 V_1 V_2$, $V_2 V_2 V_3$, and $V_3 V_3 V_1$. A recent surprising result of Balogh-Clemen-Lidický [J. Lond. Math. Soc. (2) 106 (2022)] shows that this conjecture is asymptotically true in the $\ell_2$-norm, where the number of edges is replaced by the sum of squared codegrees. They further conjectured that, in this $\ell_2$-norm setting, the $3$-partite construction is uniquely extremal for large $n$. We confirm this conjecture.
Two key ingredients in our proofs include establishing a Mantel theorem for vertex-colored graphs that forbid certain types of triangles, and introducing a novel procedure integrated into Simonovits' stability method, which essentially reduces the task to verifying that the $\ell_2$-norm of certain near-extremal constructions increases under suitable local modifications. The strategy in the latter may be of independent interest and potentially applicable to other extremal problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12506 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tetrahedron Conjecture in the $\ell_2$-norm Bodnár, Levente Chen, Wanfang Deng, Jinghua Hou, Jianfeng Liu, Xizhi Song, Jialei Yang, Jiabao Zhang, Yixiao Combinatorics 05C35, 05C65, 05D05 The famous Tetrahedron Conjecture of Turán from the 1940s asserts that the number of edges in an $n$-vertex $3$-graph without the tetrahedron, the complete $3$-graph on four vertices, cannot exceed that of the balanced complete cyclic $3$-partite $3$-graph, whose edges are of types $V_1 V_2 V_3$, $V_1 V_1 V_2$, $V_2 V_2 V_3$, and $V_3 V_3 V_1$. A recent surprising result of Balogh-Clemen-Lidický [J. Lond. Math. Soc. (2) 106 (2022)] shows that this conjecture is asymptotically true in the $\ell_2$-norm, where the number of edges is replaced by the sum of squared codegrees. They further conjectured that, in this $\ell_2$-norm setting, the $3$-partite construction is uniquely extremal for large $n$. We confirm this conjecture. Two key ingredients in our proofs include establishing a Mantel theorem for vertex-colored graphs that forbid certain types of triangles, and introducing a novel procedure integrated into Simonovits' stability method, which essentially reduces the task to verifying that the $\ell_2$-norm of certain near-extremal constructions increases under suitable local modifications. The strategy in the latter may be of independent interest and potentially applicable to other extremal problems. |
| title | Tetrahedron Conjecture in the $\ell_2$-norm |
| topic | Combinatorics 05C35, 05C65, 05D05 |
| url | https://arxiv.org/abs/2511.12506 |