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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d1fe9ff07a3
DTSTART;TZID=America/Toronto:20250627T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250627T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-gary-au-0
SUMMARY:Tutte colloquium-Gary Au
CLASS:PUBLIC
DESCRIPTION:TITLE:Worst-case instances of the stable set problem of graphs 
 for the\nLovász–Schrijver SDP hierarchy\n\nSPEAKER:\n Gary Au\n\nAFFILI
 ATION:\n University of Saskatchewan\n\nLOCATION:\n MC 5501\n\nABSTRACT:(Ba
 sed on joint work with Levent Tunçel.)\n\nIn this talk\, we discuss semid
 efinite relaxations of the stable set\nproblem of graphs generated by the 
 lift-and-project operator LS_+ (due\nto Lovász and Schrijver)\, and prese
 nt some of our recent progress on\nthis front. In particular\, we show tha
 t for every positive integer k\,\nthe smallest graph with LS_+-rank k cont
 ains exactly 3k vertices. This\nresult is sharp and settles a conjecture p
 osed by Lipták and Tunçel\nfrom 2003.\n\nThe talk will be accessible to 
 a general audience\, and does not assume\nany prior knowledge of lift-and-
 project methods.\n\n 
DTSTAMP:20260405T061807Z
END:VEVENT
END:VCALENDAR