Some Results on Lagrangians of Hypergraphs

TL;DR

This paper proves that certain colex-ordered hypergraphs maximize the Lagrangian among all hypergraphs with the same number of edges, confirming a conjecture for specific cases.

Contribution

It establishes the maximal Lagrangian property of colex-ordered hypergraphs for specific edge counts, advancing understanding of hypergraph extremal problems.

Findings

Colex-ordered hypergraphs maximize Lagrangian for certain edge counts.

Confirmed Frankl-Furedi's conjecture for specific cases in 3-uniform hypergraphs.

Provided new bounds for Lagrangians of hypergraphs with given edges.

Abstract

In 1965, Motzkin and Straus [5] provided a new proof of Turan's theorem based on a continuous characterization of the clique number of a graph using the Lagrangian of a graph. This new proof aroused interests in the study of Lagrangians of r-uniform graphs. The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. Sidorenko and Frankl-Furedi applied Lagrangians of hypergraphs in finding Turan densities of hypergraphs. Frankl and Rodl applied it in disproving Erdos' jumping constant conjecture. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and Furedi conjectured that the r-uniform graph with m edges formed by taking the first m sets in the colex ordering of $N^(r)$ has the largest Lagrangian of all r-uniform graphs with m edges. Talbot in [14] provided some evidences for Frankl and Furedi's conjecture. In this paper, we prove that the r-uniform graph with m edges formed by taking the first m sets in the colex ordering of $N^(r)$ has the largest Lagrangian of all r-uniform graphs on t vertices with m edges when ${t choose r}-3$ or ${t choose r}-4$. As an implication, we also prove that Frankl and Furedi's conjecture holds for 3-uniform graphs with ${t choose 3}-3$ or ${t choose 3}-4$ edges.