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:686a3eca542c8
DTSTART;TZID=America/Toronto:20230310T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230310T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-peter-nelson-3
SUMMARY:Tutte Colloquium - Peter Nelson
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Matroids without cliques\n\nSpeaker:\n Pete
 r Nelson\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nLocation:\n MC 5501 o
 r contact Eva Lee for Zoom link\n\nABSTRACT: The class of graphs that omi
 t some fixed complete graph as\na minor is very well-studied\; in particul
 ar\, the densest graphs in the\nclass are known. The analogous question fo
 r matroids is just as\nwell-motivated\, but seems harder to answer. I will
  discuss some recent\nprogress in this area\, which reduces a bound from d
 oubly exponential\nto singly exponential. This is joint work with Sergey N
 orin and\nFernanda Rivera Omana.\n 
DTSTAMP:20250706T091554Z
END:VEVENT
END:VCALENDAR