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

The number of 4-cycles in a graph

Author

Listed:
  • Li, Ting
  • Ren, Han

Abstract

In extremal graph theory studies, it is not yet finished to determine the exact value of ex(n;C4) in general case. Erdős and Simonovits [10] conjectured that an n-vertex graph G with ex(n;C4)+1 edges may contain at least n+o(n) 4-cycles. In this paper we investigate the number of 4-cycles in a graph. We show that the number of 4-cycles in an n-vertex graph G is at least (ϵ4n−3)/4+ϵ2/(2n) provided that |E(G)|=n(1+4n−3)/4+ϵ, where ϵ is an arbitrary positive real number. This result is an approach solving to this open problem. Furthermore, we prove that if n is large enough, then there are at least ((4ϵ−1)4n−3+5)/16+o(1) 4-cycles in an n-vertex graph with e=(n−1)(1+4n−3)/4+ϵ edges which has k vertices whose degrees are mutually different, where k≥24n3+12n−(12n)2−1/273 and ϵ>0 is a real number. In addition, we get that a triangle-free graph with n vertices and e=nn−1/2+ϵ edges has at least (2ϵ(n−1−2)+1)/4+o(1) 4-cycles, where ϵ>0 is an any real number and n is large enough. This shows that the weak version of Erdős and Simonovits' conjecture [10] holds for such graphs when n is sufficiently large. Finally, we obtain a bipartite version of this result.

Suggested Citation

  • Li, Ting & Ren, Han, 2022. "The number of 4-cycles in a graph," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    • Handle: RePEc:eee:apmaco:v:428:y:2022:i:c:s0096300322002855
    DOI: 10.1016/j.amc.2022.127211
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322002855
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127211?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bauranov, Aleksandar & Rakas, Jasenka, 2024. "Bayesian network model of aviation safety: Impact of new communication technologies on mid-air collisions," Reliability Engineering and System Safety, Elsevier, vol. 243(C).

    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:428:y:2022:i:c:s0096300322002855. 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.