2012/11/28 by Qingsong Tang, Tang, Qingsong, Hao Peng +5
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1211.7056
openalex publication_date 2012/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Lagrangian of a hypergraph. Frankl and Furedi in \citeFF conjectured that the r-graph with m edges formed by taking the first m sets in the colex ordering of \mathbb N(r) has the largest Lagrangian of all r-graphs with m edges. In this paper, we give some partial results for this conjecture.