![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > On Hamilton cycles in highly symmetric graphs
![]() On Hamilton cycles in highly symmetric graphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Richard Montgomery. This talk has been canceled/deleted 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 graphs, 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. This talk is part of the Combinatorics and Probability seminar series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsApplied Mathematics Seminar Series Metallurgy & Materials – Tech Entrepreneurship Seminar Series Optimisation and Numerical Analysis SeminarsOther talksBases for permutation groups Two-level spectral preconditioners for indefinite or non-symmetric problems Quantum Sensing in Space Ultrafast Spectroscopy and Microscopy as probes of Energy Materials TBA Life : it’s out there, but what and why ? |