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:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6af7799c7a912
DTSTART;TZID=America/Toronto:20261116T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261116T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-cece-henderson-hypergraph-nash-williams
SUMMARY:Graphs and Matroids | Cece Henderson\, On the Hypergraph Nash-Willi
 ams'\nConjecture
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Cece Henderson\n\nAFFILIATION:\n University of Water
 loo\n\nROOM:\n MC 6029\n\nABSTRACT: The study of combinatorial designs in
 cludes some of the\noldest questions at the heart of combinatorics. In a b
 reakthrough\nresult of 2014\, Keevash proved the longstanding Existence Co
 njecture\nby showing the existence of (n\,q\,r)-Steiner systems (equivalen
 tly\nK_q^r-decompositions of K_n^r) for all large enough n satisfying the\
 nnecessary divisibility conditions. Meanwhile\, in recent decades\,\nincre
 mental progress has been made on the celebrated Nash-Williams'\nConjecture
  of 1970\, which posits that any large enough\,\ntriangle-divisible graph 
 on n vertices with minimum degree at least\n3n/4 admits a triangle decompo
 sition. In 2021\, Glock\, Kühn\, and\nOsthus proposed a generalization of
  these results by conjecturing a\nhypergraph version of the Nash-Williams'
  Conjecture\, where their\nproposed minimum degree K_q^r-decomposition thr
 eshold is motivated by\nhypergraph Turán theory. By using the recently de
 veloped method of\nrefined absorption and establishing a non-uniform Turá
 n theory\, we\ntie the K_q^r-decomposition threshold to its fractional rel
 axation.\nCombined with the best-known fractional decomposition threshold 
 from\nDelcourt\, Lesgourgues\, and Postle\, this dramatically closes the g
 ap\nbetween what was known and the above conjecture. This talk is based on
 \njoint work with Luke Postle.
DTSTAMP:20261113T205700Z
END:VEVENT
END:VCALENDAR