BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Combinatorics Seminar
SUMMARY:Hamilton cycles in highly symmetric graphs - Torst
en Mutze (University of Warwick)
DTSTART;TZID=Europe/London:20200220T143000
DTEND;TZID=Europe/London:20200220T153000
UID:TALK137485AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/137485
DESCRIPTION:The question whether a graph has a Hamilton cycle
or not is one of the oldest and most fundamental g
raph-theoretic problems\, and one of the prototypi
cal NP-complete problems. In this talk I will surv
ey some recent results on Hamilton cycles in diffe
rent families of highly symmetric graphs. The star
ting point is our proof of the middle levels conje
cture\, and various other long-standing problems t
hat we settled subsequently\,\nincluding the Hamil
tonicity of bipartite Kneser graphs\, of sparse Kn
eser graphs\, and cycles through any range of cons
ecutive levels of the hypercube. I will highlight
how these constructions and problems link several
well-known concepts in combinatorics.\n
LOCATION:MR12
CONTACT:Andrew Thomason
END:VEVENT
END:VCALENDAR