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:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a14d3d3e055b
DTSTART;TZID=America/Toronto:20170914T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170914T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-john-sinkovic-1
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 64
 86 Waterloo ON N2L 3G1 Canada
SUMMARY:Algebraic Graph Theory Seminar - John Sinkovic
CLASS:PUBLIC
DESCRIPTION:TITLE: Using eigenvalues to bound the independence number of a
  graph\n\nSpeaker:\n John  Sinkovic\n\nAffiliation:\n University of Water
 loo\n\nLocation:\n MC 6486\n\nABSTRACT:\n\nFinding a maximum independent s
 et (or clique) in an arbitrary graph\nhas been shown to be NP-hard.  As a
 ny independent set gives a lower\nbound on the independence number\, deter
 mining an upper bound is\nusually more useful. 
DTSTAMP:20260525T225723Z
END:VEVENT
END:VCALENDAR