University of Cambridge > Talks.cam > Combinatorics Seminar > Long cycles in hamiltonian graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Long cycles in hamiltonian graphs

Download to your calendar using vCal

  • UserAntónio Girão (University of Cambridge)
  • ClockThursday 19 October 2017, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

In 1975, Sheehan conjectured that every d-regular hamiltonian graph contains a second hamiltonian cycle. This conjecture has been verified for all d greater than 22. In the light of Sheehan’s conjecture, it is natural to ask if regularity is genuinely necessary to force the existence of a second hamiltonian cycle, or if a minimum degree condition is enough. In this talk, we shall discuss a recent result which asserts that a hamiltonian graph with minimum degree 3 must contain another cycle of order at least n-o(n), thus answering, in an asymptotic form, the above question. This work is joint with Kittipassorn and Narayanan.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Anglia Ruskin University, East Road, room Hel 252 Bateman Auditorium, Gonville & Caius College, Trinity Street, Cambridge, CB2 1TA Computer Laboratory, William Gates Building, Lecture Theatre 2

Other talks

Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Title and abstract tba Title TBC When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Coming soon Group Presentation 2
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity