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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d16f44c6458
DTSTART;TZID=America/Toronto:20190508T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190508T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-jim-geelen-0
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 17 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Jim Geelen
CLASS:PUBLIC
DESCRIPTION:TITLE: The Erdős-Pósa property for A-paths\n\nSpeaker:\n Jim
  Geelen\n\nAffiliation:\n University of Waterloo\n\nRoom: \n MC 5417\n\nA
 BSTRACT:\n\nLet A be a set of vertices in a graph G. An A-path is a path w
 hose\nends are in A. Gallai proved\, for any integer k\, that there are ei
 ther\nk disjoint A-paths or there is a set of at most 2k vertices that hit
 \nall A-paths.
DTSTAMP:20260404T200628Z
END:VEVENT
END:VCALENDAR