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:6adbad8c04b52
DTSTART;TZID=America/Toronto:20261026T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261026T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoric
 s-and-optimization-reading-group-arkaprava
SUMMARY:Combinatorics and Optimization reading group | Arkaprava Choudhury\
 ,\nProof of the Sunflower Conjecture
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Arkaprava Choudhury\n\nAFFILIATION:\n University of 
 Waterloo\n\nROOM:\n MC 6029\n\nABSTRACT: A $k$-sunflower is a family of $
 k$ distinct sets whose\npairwise intersections all coincide. The Erd\\H{o}
 s--Szemer\\'edi\nconjecture asserts that for every $k \\ge 3$ there is a c
 onstant $c_k <\n2$ such that any $k$-sunflower-free family $\\mathcal{F} \
 \subseteq\n2^{[n]}$ satisfies $|\\mathcal{F}| \\le c_k^{\\\,n}$. Bucic\, H
 e\, and Lee\nrecently proved this with an explicit bound.\n\nIn this talk 
 we survey the problem and its place among sunflower\nquestions\, then work
  through the proof\, centered on a vector-sunflower\nargument. We also dis
 cuss how the result relates to a related problem\,\nthe uniform Erd\\H{o}s
 --Rado conjecture\, which it does not settle. No\nprior background is assu
 med. 
DTSTAMP:20261023T185508Z
END:VEVENT
END:VCALENDAR