![]() |
![]() |
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 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:
Note that ex-directory lists are not shown. |
Other listsPostgraduate Seminars in the School of Computer Science Facts and Snacks Optimisation and Numerical Analysis SeminarsOther talksProvably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Extending the Lax type operator for finite W-algebras TBC Modelling uncertainty in image analysis. TBC Geometry of alternating projections in metric spaces with bounded curvature |