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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e045df28926
DTSTART;TZID=America/Toronto:20230310T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230310T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-peter-nelson-3
SUMMARY:Tutte Colloquium - Peter Nelson
CLASS:PUBLIC
DESCRIPTION:TITLE: Matroids without cliques\n\nSpeaker:\n Peter Nelson\n\n
 Affiliation:\n University of Waterloo\n\nLocation:\n MC 5501 or contact Ev
 a Lee for Zoom link\n\nABSTRACT: The class of graphs that omit some fixed
  complete graph as\na minor is very well-studied\; in particular\, the den
 sest graphs in the\nclass are known. The analogous question for matroids i
 s just as\nwell-motivated\, but seems harder to answer. I will discuss som
 e recent\nprogress in this area\, which reduces a bound from doubly expone
 ntial\nto singly exponential. This is joint work with Sergey Norin and\nFe
 rnanda Rivera Omana.
DTSTAMP:20260416T021351Z
END:VEVENT
END:VCALENDAR