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:68279cdb9c0dc
DTSTART;TZID=America/Toronto:20171109T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20171109T153000
URL:/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-ben-moore
SUMMARY:Graphs and Matroids Seminar - Ben Moore
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: An application of graph \"recolouring”\n\
 nSpeaker:\n Ben Moore\n\nAffiliation:\n University of ��ݮ��Ƶ\n\nRoom:\n 
 MC 5479\n\nABSTRACT:\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 chromatic\nnumber of G is less or equal to k.\n 
DTSTAMP:20250516T201523Z
END:VEVENT
END:VCALENDAR