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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e542c85bc2
DTSTART;TZID=America/Toronto:20200619T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200619T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-nicolas-trotignon
SUMMARY:Tutte Colloquium - Nicolas Trotignon
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Widths in even-hole-free graphs\n\nSpeaker:
 \n Nicolas Trotignon\n\nAffiliation:\n CNRS - LIP - École Normale Supéri
 eure de Lyon\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nHistoric
 ally\, the study of even-hole-free graphs is motivated by the\nanalogy wit
 h perfect graphs. The decomposition theorems that are\nknown for even-hol
 e-free graphs are seemingly more powerful than the\nones for perfect graph
 s: the basic classes and the decompositions are\nin some respect more res
 tricted. But strangely\, in an algorithmic\nperpective\, much more is know
 n for perfect graphs. \n 
DTSTAMP:20250521T223108Z
END:VEVENT
END:VCALENDAR