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:69ce970d854dc
DTSTART;TZID=America/Toronto:20251201T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251201T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-fernanda-rivera-omana
SUMMARY:Graphs and Matroids - Fernanda Rivera Omana
CLASS:PUBLIC
DESCRIPTION:TITLE:Erdős-Pósa theorem for matroids\n\nSPEAKER:\n Fernanda
  Rivera Omana\n\nAFFILIATION:\n University of Waterloo\n\nROOM:\n MC 6029\
 n\nABSTRACT: We will look at an analogue theorem of the classical\nErdős
 -Pósa Theorem. We prove a $GF(q)$-representable matroid\nanalogue of Robe
 rtson and Seymour's theorem that planar graphs have an\nErdős-Pósa prope
 rty. Given a matroid $N$\, we prove that for every\nmatroid $M$ with bound
 ed branch width\, $M$ either contains $r$ skew\ncopies of $N$\, or there i
 s a small perturbation of $M$ that doesn't\ncontain $N$ as a minor.
DTSTAMP:20260402T161925Z
END:VEVENT
END:VCALENDAR