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:69cfe6eb38373
DTSTART;TZID=America/Toronto:20190801T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190801T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-clair-dai
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 17 Waterloo ON N2L 3G1 Canada
SUMMARY:Algebraic Combinatorics Seminar - Clair Dai
CLASS:PUBLIC
DESCRIPTION:TITLE: Counting subdivergence-free gluing of trees\n\nSpeaker:
 \n Clair Dai\n\nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5417\n
 \nABSTRACT:\n\nIf we take two rooted trees with the same number of leaves 
 and form a\ngraph by gluing the leaves of one tree to the other\, then we 
 say the\ngraph is subdivergence-free if no 2-edge cut have been generated.
DTSTAMP:20260403T161227Z
END:VEVENT
END:VCALENDAR