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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6aa9b4a46b149
DTSTART;TZID=America/Toronto:20240412T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240412T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-luke-postle-4
SUMMARY:Tutte Colloquium - Luke Postle
CLASS:PUBLIC
DESCRIPTION:A PROOF OF NASH-WILLIAMS’ CONJECTURE\n\nLuke Postle | Univers
 ity of Waterloo\n\nABSTRACT: A central open question in extremal design th
 eory is\nNash-Williams’ Conjecture from 1970\, namely that every\ntriang
 le-divisible graph on n vertices (for n large enough) with\nminimum degree
  at least 0.75n has a triangle decomposition. In this\ntalk\, we discuss t
 he history of the problem and our recent resolution\nof this conjecture\, 
 as well as other applications in design theory. We\nalso overview the proo
 f\, highlighting the new techniques we developed\nto resolve the fractiona
 l version as well as the full conjecture.\nJoint work with Michelle Delcou
 rt.
DTSTAMP:20260915T211204Z
END:VEVENT
END:VCALENDAR