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:69cfe8d8bb27c
DTSTART;TZID=America/Toronto:20200312T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200312T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-luke-postle
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Luke Postle
CLASS:PUBLIC
DESCRIPTION:TITLE: Improving the general upper bound for Hadwiger's conjec
 ture\n\nSpeaker:\n Luke Postle\n\nAffiliation:\n University of Waterloo\n\
 nRoom:\n MC 5479\n\nABSTRACT:\n\nIn 1943\, Hadwiger conjectured that every
  K_t-minor-free graph has\nchromatic number at most t-1.
DTSTAMP:20260403T162040Z
END:VEVENT
END:VCALENDAR