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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cfe1609837e
DTSTART;TZID=America/Toronto:20200130T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200130T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-paul-wollan
LOCATION:MC - Mathematics &amp; Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Paul Wollan
CLASS:PUBLIC
DESCRIPTION:TITLE: Excluding a ladder\n\nSpeaker:\n Paul Wollan\n\nAffilia
 tion:\n Sapienza Università di Roma\n\nRoom:\n MC 5479\n\nABSTRACT:\n\nA 
 folklore result says that if a graph does not contain the path of\nlength 
 k as a subgraph\, then it has tree-depth at most k.
DTSTAMP:20260403T154848Z
END:VEVENT
END:VCALENDAR