Long cycles in hamiltonian graphs

Add to your list(s) Download to your calendar using vCal

• António Girão (University of Cambridge)
• Thursday 19 October 2017, 14:30-15:30
• MR12.

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:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.