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:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683a64a3cb21a
DTSTART;TZID=America/Toronto:20200124T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200124T130000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-ben-moore
SUMMARY:Combinatorial Optimization Reading Group - Ben Moore
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: On the Strong Nine Dragon Tree Conjecture\n
 \nSpeaker:\n Ben Moore\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nRoom:\n
  MC 5417\n\nABSTRACT:\n\nNash-Williams forest covering theorem says that a
  graph decomposes\ninto $k$ forests if and only if it has fractional arbor
 icity at most\n$k$. In 2012 Mickeal Montassier\, Patrice Ossona de Mendez\
 , Andre\nRaspaud\, and Xuding Zhu  proposed a significant strengthening o
 f\nNash-Williams Theorem\, called the Strong Nine Dragon Tree Conjecture.\
 n 
DTSTAMP:20250531T020835Z
END:VEVENT
END:VCALENDAR