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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce8e8390896
DTSTART;TZID=America/Toronto:20250926T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250926T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-penny-haxell-1
SUMMARY:Tutte Colloquium - Penny Haxell
CLASS:PUBLIC
DESCRIPTION:TITLE: Graphs with High Chromatic Number\n\nSPEAKER:\n Penny H
 axell\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 5501\n\nA
 BSTRACT: The classical theorem of Brooks tells us that if a graph G\nhas 
 no colouring with its maximum degree ∆≥3 colours\, then it\ncontains
  a clique with ∆+1 vertices. Does a similar phenomenon\noccur when th
 e chromatic number is slightly smaller than ∆? Even\nthe next case is u
 nknown: in 1977\, Borodin and Kostochka famously\nconjectured that if ∆
 ≥9 and G has no (∆-1)-colouring then it\ncontains a ∆(G)-clique. 
 We discuss various results and questions\naround this conjecture.
DTSTAMP:20260402T154259Z
END:VEVENT
END:VCALENDAR