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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d13f22903
DTSTART;TZID=America/Toronto:20231215T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231215T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-david-wajc
SUMMARY:Tutte Colloquium - David Wajc
CLASS:PUBLIC
DESCRIPTION:TITLE: Online edge colouring\n\nSPEAKER:\n David Wajc\n\nAFFILI
 ATION:\n Technion — Israel Institute of Technology\n\nLOCATION:\n MC 550
 1\n\nABSTRACT: Vizing's Theorem provides an algorithm that edge colors any
 \ngraph of maximum degree Δ can be edge-colored using Δ+1 colors\,\nwhi
 ch is necessary for some graphs\, and at most one higher than\nnecessary f
 or any graph. In online settings\, the trivial greedy\nalgorithm requires 
 2Δ-1 colors\, and Bar-Noy\, Motwani and Naor in the\nearly 90s showed tha
 t this is best possible\, at least in the\nlow-degree regime.
DTSTAMP:20260404T085215Z
END:VEVENT
END:VCALENDAR