Frankl–Füredi conjecture on hypergraph Lagrangians
For a set , let denote the family of all subsets of of size . An -graph is a family , and its Lagrangian is
Let be the family consisting of the first members of the colexicographic order on , where if and only if .
Frankl–Füredi conjecture. If is an -graph with edges, then
This conjecture asks which -graph with a prescribed number of edges maximizes the Lagrangian. It is a central problem in extremal combinatorics and is false in general, as indicated by the paper's title; the conjecture is therefore refuted, although particular cases may still hold.
References
12 papers in this index state this conjecture (2011–2018). The statement above is taken from the most recent of them; the others are arXiv:1806.11259, arXiv:1806.10846, arXiv:1501.01913, arXiv:1405.2855, arXiv:1312.3034, arXiv:1311.1409, arXiv:1311.1062, arXiv:1212.2795, arXiv:1211.7057, arXiv:1211.6508, arXiv:1110.1623.
Source: Vytautas Gruslys, Shoham Letzter and Natasha Morrison, “Hypergraph Lagrangians I: the Frankl-Füredi conjecture is false”, arXiv:1807.00793 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.