BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Hamilton cycles in highly symmetric graphs - Torsten Mutze (Univer
 sity of Warwick)
DTSTART:20200220T143000Z
DTEND:20200220T153000Z
UID:TALK137485@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:The question whether a graph has a Hamilton cycle or not is on
 e of the oldest and most fundamental graph-theoretic problems\, and one of
  the prototypical NP-complete problems. In this talk I will survey some re
 cent 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\,\ni
 ncluding the Hamiltonicity of bipartite Kneser graphs\, of sparse Kneser g
 raphs\, and cycles through any range of consecutive levels of the hypercub
 e. I will highlight how these constructions and problems link several well
 -known concepts in combinatorics.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR