# Lagrangians of hypergraphs: The Frankl-F\"uredi conjecture holds almost everywhere

## TL;DR

This paper proves the Frankl-F"uredi conjecture for hypergraph Lagrangians in most cases when the uniformity is at least 4 and large, extending previous results and improving bounds for the case r=3.

## Contribution

The authors establish the conjecture for all r ≥ 4 and large t, covering most m, and improve bounds for r=3, advancing understanding of hypergraph Lagrangians.

## Key findings

- Proved the conjecture for r ≥ 4 and large t.
- Verified the conjecture for most m in a specified range.
- Improved bounds for the case r=3.

## Abstract

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$ their conjecture states that every $H\subseteq \mathbb{N}^{(r)}$ of size $\binom{t}{r}$ satisfies \begin{align*} \max \{\sum_{A \in H}\prod_{i\in A} y_i \ \colon \ y_1,y_2,\ldots \geq 0; \sum_{i\in \mathbb{N}} y_i=1 \}&\leq \frac{1}{t^r}\binom{t}{r}. \end{align*} We prove the above statement for all $r\geq 4$ and large values of $t$ (the case $r=3$ was settled by Talbot in 2002). More generally, we show for any $r\geq 4$ that the Frankl-F\"uredi conjecture holds whenever $\binom{t-1}{r} \leq m \leq \binom{t}{r}- \gamma_r t^{r-2}$ for a constant $\gamma_r>0$, thereby verifying it for `most' $m\in \mathbb{N}$. Furthermore, for $r=3$ we make an improvement on the results of Talbot~\cite{Tb} and Tang, Peng, Zhang and Zhao~\cite{TPZZ}.