COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Kneser graphs are HamiltonianAdd to your list(s) Download to your calendar using vCal - Torsten Mutze (Warwick)
- Thursday 08 February 2024, 14:30-15:30
- MR12.
If you have a question about this talk, please contact ibl10. or integers k>=1 and n>=2k+1, the Kneser graph K(n,k) has as vertices all k-element subsets of an n-element ground set, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle, with one notable exception, namely the Petersen graph K(5,2). This problem received considerable attention in the literature, including a recent solution for the sparsest case n=2k+1. The main contribution of our work is to prove the conjecture in full generality. We also extend this Hamiltonicity result to all connected generalized Johnson graphs (except the Petersen graph). The generalized Johnson graph J(n,k,s) has as vertices all k-element subsets of an n-element ground set, and an edge between any two sets whose intersection has size exactly s. Clearly, we have K(n,k)=J(n,k,0), i.e., generalized Johnson graphs include Kneser graphs as a special case. Our results imply that all known families of vertex-transitive graphs defined by intersecting set systems have a Hamilton cycle, which settles an interesting special case of Lovász’ conjecture on Hamilton cycles in vertex-transitive graphs from 1970. Our main technical innovation is to study cycles in Kneser graphs by a kinetic system of multiple gliders that move at different speeds and that interact over time, reminiscent of the gliders in Conway’s Game of Life, and to analyze this system combinatorially and via linear algebra. This is joint work with my students Arturo Merino (TU Berlin) and Namrata (Warwick). 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. |
## Other listsCambridge Enterprise events Convertidor Mini Courses in Theoretical Computer Science## Other talksTitle TBC Public Guest Seminar - Institutionalising Forgiveness : Interpersonal Ideas in Criminal Justice Santaló Geometry of Convex Polytopes E. coli and the Game of Clones Energy-conserving equivariant GNN predictions of stiffness for lattice materials Thermal Shift Methods and High Throughput Screening |