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:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce865c2aec9
DTSTART;TZID=America/Toronto:20171109T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20171109T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-ben-moore
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Ben Moore
CLASS:PUBLIC
DESCRIPTION:TITLE: An application of graph \"recolouring”\n\nSpeaker:\n 
 Ben Moore\n\nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5479\n\nA
 BSTRACT:\n\nI will prove that for any graph G\, if there is an edge e such
  that G-e\nhas less than (k-1)!/2 cycles of length zero mod k\, then the c
 hromatic\nnumber of G is less or equal to k.
DTSTAMP:20260402T150812Z
END:VEVENT
END:VCALENDAR