English

Odd hypergraph Mantel theorems

Combinatorics 2025-10-16 v2

Abstract

A classical result of Sidorenko (1989) shows that the Tur\'{a}n density of every rr-uniform hypergraph with three edges is bounded from above by 1/21/2. For even rr, this bound is tight, as demonstrated by Mantel's theorem on triangles and Frankl's theorem on expanded triangles. In this note, we prove that for odd rr, the bound 1/21/2 is never attained, thereby answering a question of Keevash and revealing a fundamental difference between hypergraphs of odd and even uniformity. Moreover, our result implies that the expanded triangles form the unique class of three-edge hypergraphs whose Tur\'{a}n density attains 1/21/2.

Keywords

Cite

@article{arxiv.2510.10590,
  title  = {Odd hypergraph Mantel theorems},
  author = {Jianfeng Hou and Xizhi Liu and Yixiao Zhang and Hongbin Zhao and Tianming Zhu},
  journal= {arXiv preprint arXiv:2510.10590},
  year   = {2025}
}

Comments

13 pages, we added Theorem 4.1

R2 v1 2026-07-01T06:32:13.850Z