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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d12f2fd9b21
DTSTART;TZID=America/Toronto:20240719T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240719T161500
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-paul-seymour
SUMMARY:Tutte Colloquium - Paul Seymour
CLASS:PUBLIC
DESCRIPTION:TITLE: Nearly-linear stable sets\n\nSPEAKER:\n Paul Seymour\n\
 nAFFILIATION:\n Princeton University\n\nLOCATION:\n QNC 0101\n\nABSTRACT:
  The Gyárfás-Sumner conjecture says that for every forest\n𝐻 and com
 plete graph 𝐾\, there exists 𝑐 such that every\n{𝐻\,𝐾}-free gr
 aph (that is\, containing neither of 𝐻\,𝐾 as an\ninduced subgraph) h
 as chromatic number at most 𝑐. This is still\nopen\, but we have proved
  that every {𝐻\,𝐾}-free graph 𝐺 has\nchromatic number at most |
 𝐺|o(1).
DTSTAMP:20260404T153303Z
END:VEVENT
END:VCALENDAR