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:69d30af617523
DTSTART;TZID=America/Toronto:20200124T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200124T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-ben-moore
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 17 Waterloo ON N2L 3G1 Canada
SUMMARY:Combinatorial Optimization Reading Group - Ben Moore
CLASS:PUBLIC
DESCRIPTION:TITLE: On the Strong Nine Dragon Tree Conjecture\n\nSpeaker:\n
  Ben Moore\n\nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5417\n\n
 ABSTRACT:\n\nNash-Williams forest covering theorem says that a graph decom
 poses\ninto $k$ forests if and only if it has fractional arboricity at mos
 t\n$k$. In 2012 Mickeal Montassier\, Patrice Ossona de Mendez\, Andre\nRas
 paud\, and Xuding Zhu  proposed a significant strengthening of\nNash-Will
 iams Theorem\, called the Strong Nine Dragon Tree Conjecture.
DTSTAMP:20260406T012302Z
END:VEVENT
END:VCALENDAR