BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Pancyclicity of highly connected graphs - Shoham Letzter (UCL)
DTSTART:20231012T133000Z
DTEND:20231012T143000Z
UID:TALK207088@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION: A classic result of Chvatál and Erdős (1972) asserts that\,
  if the\nvertex-connectivity of a graph G is at least as large as its inde
 pendence\nnumber\, then G has a Hamilton cycle. We prove that a similar co
 ndition\nimplies that a graph G is pancyclic\, namely it contains cycles o
 f all\nlengths between 3 and |G|: we show that if |G| is large and the\nve
 rtex-connectivity of G is larger than its independence number\, then G is\
 npancyclic. This confirms a conjecture of Jackson and Ordaz (1990) for lar
 ge\ngraphs.
LOCATION:MR12
END:VEVENT
END:VCALENDAR