Skip to main content
SpringerLink
Log in

Erdős–Gyárfás conjecture for some families of Cayley graphs

  • Published:
Aequationes mathematicae Aims and scope Submit manuscript

Abstract

The Paul Erdős and András Gyárfás conjecture states that every graph of minimum degree at least 3 contains a simple cycle whose length is a power of two. In this paper, we prove that the conjecture holds for Cayley graphs on generalized quaternion groups, dihedral groups, semidihedral groups and groups of order \(p^3\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Daniel, D., Shauger, S.E.: A result on the Erdős–Gyárfás conjecture in planar graphs. In: Proceedings of the Thirty-Second Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 2001), vol. 153, pp. 129–139 (2001)

  2. Erdős, P.: Some old and new problems in various branches of combinatorics. Discrete Math. 165/166, 227–231 (1997). Graphs and Combinatorics (Marseille, 1995)

  3. Heckman, C.C., Krakovski R.: Erdős–Gyárfás conjecture for cubic planar graphs. Electron. J. Comb. 20(2), 7, 43 (2013)

  4. Hungerford, T.W.: Algebra, volume 73 of Graduate Texts in Mathematics. Springer, New York (1980)

    Google Scholar 

  5. Markström, K.: Extremal graphs for some problems on cycles in graphs. In: Proceedings of the Thirty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 171, pp. 179–192 (2004)

  6. Shauger, S.E.: Results on the Erdős-Gyárfás conjecture in \(K_{1,m}\)-free graphs. In: Proceedings of the Twenty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), vol. 134, pp. 61–65 (1998)

  7. Witte, D.: Cayley digraphs of prime-power order are Hamiltonian. J. Comb. Theory Ser. B 40(1), 107–112 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cryptography and Data Security Laboratory, School of Mathematics, Iran University of Science and Technology, Tehran, Iran

    Mohammad Hossein Ghaffari & Zohreh Mostaghim

Authors
  1. Mohammad Hossein Ghaffari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zohreh Mostaghim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zohreh Mostaghim.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghaffari, M.H., Mostaghim, Z. Erdős–Gyárfás conjecture for some families of Cayley graphs. Aequat. Math. 92, 1–6 (2018). https://doi.org/10.1007/s00010-017-0518-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00010-017-0518-3

Keywords

Mathematics Subject Classification

Search

Navigation