Lagrangians of Hypergraphs II: When colex is best
Abstract
A well-known conjecture of Frankl and F\"uredi from 1989 states that an initial segment of colex of has the largest Lagrangian of any r-uniform hypergraph with m hyperedges. We show that this is true when r=3. We also give a new proof of a related conjecture of Nikiforov and a counterexample to an old conjecture of Ahlswede and Katona.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.