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:69d443f9f3387
DTSTART;TZID=America/Toronto:20190626T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190626T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-zach-walsh
LOCATION:MC - Mathematics &amp; Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Zach Walsh
CLASS:PUBLIC
DESCRIPTION:TITLE: Quadratically Dense Matroids\n\nSpeaker:\n Zach Walsh\n
 \nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5479\n\nABSTRACT:\n\
 nWe discuss recent work proving that for any integer $t\\ge 2$\, any\nmaxi
 mum-sized simple $\\mathbb C$-representable matroid $M$ of large\nrank wit
 h no $U_{2\,t+3}$-minor satisfies $|M|=t{r(M)\\choose 2}+r(M)$.\nIt was no
 t our intention to prove this result\, so we will first\nexplain our origi
 nal motivation. We assume only basic knowledge of\nmatroid theory.
DTSTAMP:20260406T233834Z
END:VEVENT
END:VCALENDAR