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:682ddf045c524
DTSTART;TZID=America/Toronto:20230529T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230529T130000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-gabriel-morete
SUMMARY:C&O Reading Group: Gabriel Morete
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Bounding the extended complexity of the stab
 le set polytope on\nperfect graphs\n\nSpeaker:\n Gabriel Morete\n\nAffilia
 tion:\n University of À¶Ý®ÊÓƵ\n\nRoom:\n MC 6029\n\nABSTRACT: This week w
 e will study the extension complexity of the\nstable set polytope for perf
 ect graphs. More than 40 years ago\,\nGrötschel et al. gave an algorithm 
 to find maximal weight stable sets\non perfect graphs based on a compact s
 emidefinite extension. However\,\nwhether there is a compact linear extens
 ion is still an open problem. \n 
DTSTAMP:20250521T141116Z
END:VEVENT
END:VCALENDAR