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:69d45ede3367b
DTSTART;TZID=America/Toronto:20191010T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191010T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-logan-grout
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Graphs and Matroids Seminar - Logan Grout
CLASS:PUBLIC
DESCRIPTION:TITLE: A Pseudoforest Analogue of the Strong Nine Dragon Tree
 \nConjecture\n\nSpeaker:\n Logan Grout\n\nAffiliation:\n University of Wat
 erloo\n\nRoom:\n MC 5501\n\nABSTRACT:\n\nIn 2016\, Jiang and Yang proved t
 he Nine Dragon Tree Conjecture\, a\nstrengthening of the classical arboric
 ity result of Nash-Williams\n(1964). On the way to developing this proof\,
  Fan\, Lim Song\, and Yang\nproved an analogous result for decomposing gra
 phs into pseudoforests\,\nwhich is a strengthening of Hakimi’s Theorem.
DTSTAMP:20260407T013318Z
END:VEVENT
END:VCALENDAR