On Hamilton cycles in highly symmetric graphs

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

• Torsten Mütze (University of Warwick)
• Thursday 08 October 2020, 16:00-17:00
• https://bham-ac-uk.zoom.us/j/87298164024?pwd=WWJBM3pKWWdGU1lucEJZZk8rbjBXQT09.

If you have a question about this talk, please contact M.Jenssen.

The question whether a graph has a Hamilton cycle or not is one of the oldest and most fundamental graph-theoretic problems, and one of the prototypical NP-complete problems. In this talk I will survey some recent results on Hamilton cycles in different families of highly symmetric graphs. The starting point is our proof of the middle levels conjecture, and various other long-standing problems that we settled subsequently, including the Hamiltonicity of bipartite Kneser, of sparse Kneser graphs, and cycles through any range of consecutive levels of the hypercube. I will highlight how these constructions and problems link several well-known concepts in combinatorics and algorithms. _

Meeting ID: 872 9816 4024 Passcode: 604350

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• Combinatorics and Probability seminar
• School of Mathematics events
• https://bham-ac-uk.zoom.us/j/87298164024?pwd=WWJBM3pKWWdGU1lucEJZZk8rbjBXQT09

Note that ex-directory lists are not shown.