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:69d3ea9162817
DTSTART;TZID=America/Toronto:20190919T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190919T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-peter-nelson-3
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Peter Nelson
CLASS:PUBLIC
DESCRIPTION:TITLE: The sparsest matroids omitting an independent flat\n\nS
 peaker:\n Peter Nelson\n\nAffiliation:\n University of Waterloo\n\nRoom:\n
  MC 5501\n\nABSTRACT:\n\nGiven integers $k\,r \\ge 1$\, what is the smalle
 st a rank-$r$ matroid\ncan be that does not contain a $k$-element independ
 ent set that is\nalso a flat? I will answer this question\, characterize t
 he extremal\nexamples\, and draw parallels with a problem in graph theory.
DTSTAMP:20260406T171705Z
END:VEVENT
END:VCALENDAR