Odd hypergraph Mantel theorems
Abstract
A classical result of Sidorenko (1989) shows that the Tur\'an density of every r-uniform hypergraph with three edges is bounded from above by 1/2. For even r, 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 r, the bound 1/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\'an density attains 1/2.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.