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:68d20f0a890ee
DTSTART;TZID=America/Toronto:20190605T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190605T153000
URL:/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-catherine-greenhill
SUMMARY:Graphs and Matroids Seminar - Catherine Greenhill
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Approximately counting independent sets in 
 graphs with bounded\nbipartite pathwidth\n\nSpeaker:\n Catherine Greenhill
 \n\nAffiliation:\n University of New South Wales\n\nRoom:\n MC 5479\n\nABS
 TRACT:\n\nIn 1989\, Jerrum and Sinclair showed that a natural Markov chain
  for\ncounting\nmatchings in a given graph G is rapidly mixing.\n 
DTSTAMP:20250923T030754Z
END:VEVENT
END:VCALENDAR