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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6aa0b5110f288
DTSTART;TZID=America/Toronto:20260911T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260911T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-luke-postle-university-waterloo
SUMMARY:Tutte Colloquium - Luke Postle\, University of Waterloo
CLASS:PUBLIC
DESCRIPTION:Title: A PROOF OF NASH-WILLIAMS’ CONJECTURE\n\nSpeaker: Luke
  Postle\n  \n\nAffiliation: University of Waterloo\n  \n\nLocation: MC 5
 501\n  \n\nAbstract: A central open question in extremal design theory i
 s\nNash-Williams’ Conjecture from 1970\, namely that every\ntriangle-div
 isible graph on n vertices (for n large enough) with\nminimum degree at le
 ast 0.75n has a triangle decomposition. In this\ntalk\, we discuss the his
 tory of the problem and our recent resolution\nof this conjecture\, as wel
 l as other applications in design theory. We\nalso overview the proof\, hi
 ghlighting the new techniques we developed\nto resolve the fractional vers
 ion as well as the full conjecture.\nJoint work with Michelle Delcourt.
DTSTAMP:20260909T012329Z
END:VEVENT
END:VCALENDAR