首页|Maximisers of the hypergraph Lagrangian outside the principal range
Maximisers of the hypergraph Lagrangian outside the principal range
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
? 2022The Lagrangian of a hypergraph is a function that has featured notably in hypergraph Turán densities. Motzkin and Straus established the relationship between Lagrangian and the maximum clique in a graph. As a generalization of Motzkin-Straus Theorem, Frankl and Füredi put forward a well-known conjecture, which states that the r-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-graphs with m edges. The conjecture was settled when r=3 for sufficiently large m, and is false outside the principal range for r≥4, proved by Gruslys, Letzter and Morrison. Until now, it is still open to characterize the maximisers of the hypergraph Lagrangian outside the principal range for r≥4. In this paper, we study the conjecture outside the principal range. We determine the smallest number of edges for which the conjecture is false, and also partially characterize the maximisers of the Lagrangian.
Colex orderingHypergraphLagrangian
Gu R.、Lei H.、Peng Y.、Shi Y.
展开 >
College of Science Hohai University
School of Statistics and Data Science LPMC and KLMDASR Nankai University
School of Mathematics Hunan University
Center for Combinatorics and LPMC Nankai University
NSTL
Elsevier
