IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v434y2022ics0096300322004921.html
   My bibliography  Save this article

Maximisers of the hypergraph Lagrangian outside the principal range

Author

Listed:
  • Gu, Ran
  • Lei, Hui
  • Peng, Yuejian
  • Shi, Yongtang

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.

Suggested Citation

  • Gu, Ran & Lei, Hui & Peng, Yuejian & Shi, Yongtang, 2022. "Maximisers of the hypergraph Lagrangian outside the principal range," Applied Mathematics and Computation, Elsevier, vol. 434(C).
    • Handle: RePEc:eee:apmaco:v:434:y:2022:i:c:s0096300322004921
    DOI: 10.1016/j.amc.2022.127418
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322004921
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127418?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:434:y:2022:i:c:s0096300322004921. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.