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:69d172a139500
DTSTART;TZID=America/Toronto:20200619T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200619T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-nicolas-trotignon
SUMMARY:Tutte Colloquium - Nicolas Trotignon
CLASS:PUBLIC
DESCRIPTION:TITLE: Widths in even-hole-free graphs\n\nSpeaker:\n Nicolas T
 rotignon\n\nAffiliation:\n CNRS - LIP - École Normale Supérieure de Lyon
 \n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nHistorically\, the s
 tudy of even-hole-free graphs is motivated by the\nanalogy with perfect gr
 aphs. The decomposition theorems that are\nknown for even-hole-free graph
 s are seemingly more powerful than the\nones for perfect graphs: the basic
  classes and the decompositions are\nin some respect more restricted. But
  strangely\, in an algorithmic\nperpective\, much more is known for perfec
 t graphs. 
DTSTAMP:20260404T202049Z
END:VEVENT
END:VCALENDAR