BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e8193b15a7
DTSTART;TZID=America/Toronto:20221111T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221111T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-linda-cook
SUMMARY:Tutte Colloquium - Linda Cook
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Forbidding some induced cycles in a graph\n\
 nSpeaker:\n Linda Cook\n\nAffiliation:\n Institute for Basic Science\, Sou
 th Korea\n\nLocation:\n MC 5501 or contact Melissa Cambridge for Zoom link
 \n\nABSTRACT:  We call an induced cycle of length at least four a hole.\n
 The parity of a hole is the parity of its length. Forbidding holes of\ncer
 tain lengths in a graph has deep structural implications. In 2006\,\nChudn
 ovksy\, Seymour\, Robertson\, and Thomas famously proved that a\ngraph is 
 perfect if and only if it does not contain an odd hole or a\ncomplement of
  an odd hole. In 2002\, Conforti\, Cornuéjols\, Kapoor\, and\nVušković 
 provided a structural description of the class of\neven-hole-free graphs.\
 n 
DTSTAMP:20250522T014451Z
END:VEVENT
END:VCALENDAR