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

Linear saturation numbers of Berge-C3 and Berge-C4

Author

Listed:
  • Wang, Changxin
  • Zhang, Junxue

Abstract

The linear saturation number satklin(n,F) (linear extremal number exklin(n,F)) of F is the minimum (maximum) number of hyperedges of an n-vertex linear k-uniform hypergraph containing no member of F as a subgraph, but the addition of any new hyperedge such that the result hypergraph is still a linear k-uniform hypergraph creates a copy of some hypergraph in F. Determining ex3lin(n, Berge-C3) is equivalent to the famous (6,3)-problem, which has been settled in 1976. Since then, determining the linear extremal numbers of Berge cycles was extensively studied. As the counterpart of this problem in saturation problems, the problem of determining the linear saturation numbers of Berge cycles is considered. In this paper, we prove that satklin(n, Berge-Ct)≥⌊n−1k−1⌋ for any integers k≥3, t≥3, and the equality holds if t=3. In addition, we provide an upper bound for sat3lin(n, Berge-C4) and for any disconnected Berge-C4-saturated linear 3-uniform hypergraph, we give a lower bound for the number of hyperedges of it.

Suggested Citation

  • Wang, Changxin & Zhang, Junxue, 2024. "Linear saturation numbers of Berge-C3 and Berge-C4," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    • Handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001577
    DOI: 10.1016/j.amc.2024.128685
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001577
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128685?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:474:y:2024:i:c:s0096300324001577. 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.