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:69e3f442430f2
DTSTART;TZID=America/Toronto:20230612T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230612T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-william-linz
SUMMARY:Algebraic Graph Theory - William Linz
CLASS:PUBLIC
DESCRIPTION:TITLE: L-systems and the Lovasz number\n\nSPEAKER:\n William Li
 nz\n\nAFFILIATION:\n University of South Carolina\n\nLOCATION:\n Please co
 ntact Sabrina Lato for Zoom link\n\nABSTRACT: For positive integers n an
 d k\, an L-system is a collection\nof k-uniform subsets of a set of size n
  whose pairwise intersection\nsizes all lie in in the set L. The maximum s
 ize of an L-system is\nequal to the independence number of a certain union
  of graphs in the\nJohnson scheme. The Lovasz number is a semidefinite pro
 gramming\napproximation of the independence number of a graph. In this tal
 k\, we\nsurvey the relationship between the maximum size of an L-system an
 d\nthe Lovasz number\, illustrating examples both where the Lovasz number\
 nis a good approximation and where it is a bad approximation.
DTSTAMP:20260418T211442Z
END:VEVENT
END:VCALENDAR