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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea4e1ba7e7
DTSTART;TZID=America/Toronto:20230626T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230626T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/ura-seminar-
 jeremy-chizewer
SUMMARY:URA Seminar - Jeremy Chizewer
CLASS:PUBLIC
DESCRIPTION:TITLE: Restricted Intersections and the Sunflower Problem\n\nSP
 EAKER:\n Jeremy Chizewer\n\nAFFILIATION:\n University of Waterloo\n\nLOCAT
 ION:\n MC 5479\n\nABSTRACT: A sunflower with $r$ petals is a collection of
  $r$ sets over\na ground set $X$ such that every element in $X$ is in no s
 et\, every\nset\, or exactly one set. Erdos and Rado showed that a family
  of sets\nof size $n$ contains a sunflower if there are more than $n!(r-1)
 ^n$\nsets in the family. Alweiss et al. and subsequently Rao improved this
 \nbound to $(O(r \\log(rn))^n$.
DTSTAMP:20260402T171825Z
END:VEVENT
END:VCALENDAR