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:6827a0bb8de27
DTSTART;TZID=America/Toronto:20180403T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180403T100000
URL:/combinatorics-and-optimization/events/special-semi
 nar-paul-seymour
SUMMARY:Special Seminar - Paul Seymour
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Erdos-Hajnal meets Gyarfas-Sumner\n\nSpeaker
 :\n Paul Seymour\n\nAffiliation:\n Princeton\n\nRoom:\n QNC 1501\n\nABSTRA
 CT:\n\nThe Gyarfas-Sumner conjecture says that every graph with huge (enou
 gh)\nchromatic number and bounded clique number contains any given forest\
 nas an induced subgraph. (And non-forests do not have this property.)\n 
DTSTAMP:20250516T203155Z
END:VEVENT
END:VCALENDAR