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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6830b8f28d922
DTSTART;TZID=America/Toronto:20230515T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230515T130000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-jacob-skitsko
SUMMARY:C&O Reading Group - Jacob Skitsko
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: The matching polytope has exponential extens
 ion complexity\n\nSpeaker:\n Jacob Skitsko\n\nAffiliation:\n University of
  ��ݮ��Ƶ\n\nLocation:\n MC 6029\n\nABSTRACT: This Friday we will build o
 ff of some previous results by\nlooking at the paper “The matching polyt
 ope has exponential\nextension complexity” by Thomas Rothvoss! At the be
 ginning of the\nsemester\, we saw that the matching (and TSP) polytopes ca
 nnot be\nexpressed by a polynomial sized symmetric LP.\n 
DTSTAMP:20250523T180538Z
END:VEVENT
END:VCALENDAR