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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf6930827b9
DTSTART;TZID=America/Toronto:20180510T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180510T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar
CLASS:PUBLIC
DESCRIPTION:TITLE: Coloring Graphs of Bounded Maximum Degree with Small Cl
 ique\nNumber\n\nSpeaker:\n Tom Kelly\n\nAffiliation:\n University of Water
 loo\n\nRoom:\n MC 5479\n\nABSTRACT: Greedy coloring yields an upper bound 
 on the chromatic\nnumber $\\chi$ of $\\Delta+1$ for graphs of maximum deg
 ree at most\n$\\Delta$\, which is tight for cliques. 
DTSTAMP:20260403T071600Z
END:VEVENT
END:VCALENDAR