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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ceb54db2153
DTSTART;TZID=America/Toronto:20190605T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190605T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-catherine-greenhill
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Catherine Greenhill
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximately counting independent sets in graphs with 
 bounded\nbipartite pathwidth\n\nSpeaker:\n Catherine Greenhill\n\nAffiliat
 ion:\n University of New South Wales\n\nRoom:\n MC 5479\n\nABSTRACT:\n\nIn
  1989\, Jerrum and Sinclair showed that a natural Markov chain for\ncounti
 ng\nmatchings in a given graph G is rapidly mixing.
DTSTAMP:20260402T182829Z
END:VEVENT
END:VCALENDAR