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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3a9d5266a8
DTSTART;TZID=America/Toronto:20190913T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190913T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-richard-lang
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Richard Lang
CLASS:PUBLIC
DESCRIPTION:TITLE: Monochromatic cycle partitions\n\nSpeaker:\n Richard La
 ng\n\nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5501\n\nABSTRACT
 :\n\nA classic result of Erdős\, Gyárfás\, and Pyber states that the\nv
 ertex set of every complete graph\, whose edges have been coloured\nwith r
  colours\, can be covered by r2 log r disjoint monochromatic\ncycles.
DTSTAMP:20260406T124053Z
END:VEVENT
END:VCALENDAR