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:69e4e5aeb7530
DTSTART;TZID=America/Toronto:20221111T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221111T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-linda-cook
SUMMARY:Tutte Colloquium - Linda Cook
CLASS:PUBLIC
DESCRIPTION:TITLE: Forbidding some induced cycles in a graph\n\nSpeaker:\n 
 Linda Cook\n\nAffiliation:\n Institute for Basic Science\, South Korea\n\n
 Location:\n MC 5501 or contact Melissa Cambridge for Zoom link\n\nABSTRACT
 :  We call an induced cycle of length at least four a hole.\nThe parity o
 f a hole is the parity of its length. Forbidding holes of\ncertain lengths
  in a graph has deep structural implications. In 2006\,\nChudnovksy\, Seym
 our\, Robertson\, and Thomas famously proved that a\ngraph is perfect if a
 nd 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 s
 tructural description of the class of\neven-hole-free graphs.
DTSTAMP:20260419T142446Z
END:VEVENT
END:VCALENDAR