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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6827c0473b138
DTSTART;TZID=America/Toronto:20181115T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181115T153000
URL:/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-michelle-delcourt-0
SUMMARY:Graphs and Matroids Seminar- Michelle Delcourt
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE:  A Short Proof of the Containers Theorem 
 for Hypergraphs\n\nSpeaker:\n Michelle Delcourt\n\nAffiliation:\n Universi
 ty of À¶Ý®ÊÓƵ\n\nRoom:\n MC 6486\n\nABSTRACT:  A modern trend in extrem
 al combinatorics is extending\nclassical results from the dense setting (e
 .g. Szemerédi's theorem)\n 
DTSTAMP:20250516T224631Z
END:VEVENT
END:VCALENDAR