Maximisers of the hypergraph Lagrangian outside the principal range

Ran Gu, Hui Lei, Yuejian Peng and Yongtang Shi

Applied Mathematics and Computation, 2022, vol. 434, issue C

Abstract: The 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.

Keywords: Lagrangian; Hypergraph; Colex ordering (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322004921
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:434:y:2022:i:c:s0096300322004921

DOI: 10.1016/j.amc.2022.127418

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().