BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrew Suk (UC San Diego)
DTSTART:20210329T140000Z
DTEND:20210329T150000Z
DTSTAMP:20260423T035417Z
UID:EPC/48
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/48/">Cli
 ques and sunflowers under bounded VC-dimension</a>\nby Andrew Suk (UC San 
 Diego) as part of Extremal and probabilistic combinatorics webinar\n\n\nAb
 stract\nThe VC-dimension of a set system is one of the most useful combina
 torial parameters that measures its complexity\, and\, apart from its geom
 etric applications\, it has proved to be relevant in many other areas such
  as statistics\, logic\, and learning theory.  In this talk\, I will discu
 ss two well-known combinatorial problems under bounded VC-dimension: estim
 ating multicolor Ramsey numbers and the sunflower problem.  This talk is b
 ased on joint works with Jacob Fox and Janos Pach.\n
LOCATION:https://researchseminars.org/talk/EPC/48/
END:VEVENT
END:VCALENDAR