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:69e3f6f437649
DTSTART;TZID=America/Toronto:20230529T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230529T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-gabriel-morete
SUMMARY:C&O Reading Group: Gabriel Morete
CLASS:PUBLIC
DESCRIPTION:TITLE: Bounding the extended complexity of the stable set polyt
 ope on\nperfect graphs\n\nSpeaker:\n Gabriel Morete\n\nAffiliation:\n Univ
 ersity of Waterloo\n\nRoom:\n MC 6029\n\nABSTRACT: This week we will study
  the extension complexity of the\nstable set polytope for perfect graphs. 
 More than 40 years ago\,\nGrötschel et al. gave an algorithm to find maxi
 mal weight stable sets\non perfect graphs based on a compact semidefinite 
 extension. However\,\nwhether there is a compact linear extension is still
  an open problem.
DTSTAMP:20260418T212612Z
END:VEVENT
END:VCALENDAR