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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea75c83ade
DTSTART;TZID=America/Toronto:20260406T144500
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260406T154500
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-eileen-robinson-coloring-claw-free
SUMMARY:Graphs and Matroids - Eileen Robinson-Coloring claw-free graphs of\
 nbounded codegree
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Eileen Robinson\n\nAFFILIATION:\n Université libre 
 de Bruxelles\n\nROOM:\n MC 5479\n\nABSTRACT:We define the codegree of a gi
 ven graph as the maximum number\nof neighbors that any two distinct vertic
 es have in common.\n\nIn 2002\, V. Vu proposed that for a given graph\, it
 s chromatic number\nshould never be too much larger than its codegree\, pr
 ovided that its\ncodegree is not too small as a proportion of its maximum 
 degree.
DTSTAMP:20260402T172900Z
END:VEVENT
END:VCALENDAR