Advertisement

Israel Journal of Mathematics

, Volume 229, Issue 1, pp 269–285 | Cite as

Long cycles in Hamiltonian graphs

  • António Girão
  • Teeradej Kittipassorn
  • Bhargav NarayananEmail author
Article
  • 16 Downloads

Abstract

We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length no(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Bondy, Beautiful conjectures in graph theory, European Journal of Combinatorics 37 (2014), 4–23.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    J. A. Bondy and B. Jackson, Vertices of small degree in uniquely Hamiltonian graphs, Journal of Combinatorial Theory. Series B 74 (1998), 265–275.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    R. P. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161–166.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    R. C. Entringer and H. Swart, Spanning cycles of nearly cubic graphs, Journal of Combinatorial Theory. Series B 29 (1980), 303–309.MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    H. Fleischner, Uniquely Hamiltonian graphs of minimum degree 4, Journal of Graph Theory 75 (2014), 167–177.MathSciNetCrossRefzbMATHGoogle Scholar
  6. [6]
    R. J. Gould, Advances on the Hamiltonian problem—a survey, Graphs and Combinatorics 19 (2003), 7–52.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    P. Haxell, B. Seamone and J. Verstraëte, Independent dominating sets and Hamiltonian cycles, Journal of Graph Theory 54 (2007), 233–244.MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    B. Jackson and R. W. Whitty, A note concerning graphs with unique f-factors, Journal of Graph Theory 13 (1989), 577–580.MathSciNetCrossRefzbMATHGoogle Scholar
  9. [9]
    A. Krawczyk, The complexity of finding a second Hamiltonian cycle in cubic graphs, Journal of Computer and System Sciences 58 (1999), 641–647.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    C. H. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, Journal of Computer and System Sciences 48 (1994), 498–532.MathSciNetCrossRefzbMATHGoogle Scholar
  11. [11]
    J. Petersen, Die Theorie der regulären graphs, Acta Mathematica 15 (1891), 193–220.MathSciNetCrossRefzbMATHGoogle Scholar
  12. [12]
    J. Sheehan, The multiplicity of Hamiltonian circuits in a graph, in Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Academia, Prague, 1975, pp. 477–480.Google Scholar
  13. [13]
    A. G. Thomason, Hamiltonian cycles and uniquely edge colourable graphs, Annals of Discrete Mathematics 3 (1978), 259–268.MathSciNetCrossRefzbMATHGoogle Scholar
  14. [14]
    C. Thomassen, On the number of Hamiltonian cycles in bipartite graphs, Combinatorics, Probability and Computing 5 (1996), 437–442.MathSciNetCrossRefzbMATHGoogle Scholar
  15. [15]
    C. Thomassen, Chords of longest cycles in cubic graphs, Journal of Combinatorial Theory. Series B 71 (1997), 211–214.MathSciNetCrossRefzbMATHGoogle Scholar
  16. [16]
    C. Thomassen, Independent dominating sets and a second Hamiltonian cycle in regular graphs, Journal of Combinatorial Theory. Series B 72 (1998), 104–109.MathSciNetCrossRefzbMATHGoogle Scholar
  17. [17]
    W. T. Tutte, On Hamiltonian circuits, Journal of the London Mathematical Society 21 (1946), 98–101.MathSciNetCrossRefzbMATHGoogle Scholar
  18. [18]
    J. Verstraëte, Unavoidable cycle lengths in graphs, Journal of Graph Theory 49 (2005), 151–167.MathSciNetCrossRefzbMATHGoogle Scholar
  19. [19]
    J. Verstraëte, Extremal problems for cycles in graphs, in Recent Trends in Combinatorics, IMA Volumes in Mathematics and its Applications, Vol. 159, Springer, Cham, 2016, pp. 83–116.CrossRefGoogle Scholar

Copyright information

© Hebrew University of Jerusalem 2018

Authors and Affiliations

  • António Girão
    • 1
  • Teeradej Kittipassorn
    • 2
  • Bhargav Narayanan
    • 3
    Email author
  1. 1.Department of Pure Mathematics and Mathematical StatisticsUniversity of CambridgeCambridgeUK
  2. 2.Department of Mathematics and Computer Science, Faculty of ScienceChulalongkorn UniversityBangkokThailand
  3. 3.Department of MathematicsRutgers UniversityPiscatawayUSA

Personalised recommendations