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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce8db632f6a
DTSTART;TZID=America/Toronto:20260204T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260204T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-jim-geelen-keeping-connectivity-under
SUMMARY:Graphs and Matroids - Jim Geelen-Keeping connectivity under taking\
 nminors
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jim Geelen\n\nAFFILIATION:\n University of Waterloo\
 n\nROOM:\n MC 5501\n\nABSTRACT: Suppose that you are given an ordering of
  the elements of a\n$k$-connected matroid\, and you want to remove the ele
 ments one at a\ntime\, in the given order\, keeping the intermediate matro
 ids as highly\nconnected as possible. How much connectivity can you keep?
DTSTAMP:20260402T153934Z
END:VEVENT
END:VCALENDAR