BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:David Conlon (California Institute of Technology)
DTSTART:20201214T140000Z
DTEND:20201214T150000Z
DTSTAMP:20260423T021141Z
UID:EPC/35
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/35/">Exp
 onential improvements in Ramsey theory</a>\nby David Conlon (California In
 stitute of Technology) as part of Extremal and probabilistic combinatorics
  webinar\n\n\nAbstract\nThe Ramsey number r(t) is the smallest natural num
 ber n such that every two-colouring of the edges of $K_n$ contains a monoc
 hromatic copy of $K_t$. It has been known for over seventy years that the 
 Ramsey number lies between $\\left(\\sqrt{2}\\right)^t$ and $4^t$\, but im
 proving either bound by an exponential factor remains a difficult open pro
 blem. In this lecture\, we discuss several related problems where such an 
 exponential improvement has been achieved.\n\nThis talk reflects joint wor
 k with many co-authors\, including Asaf Ferber\, Jacob Fox\, Andrey Grinsh
 pun\, Xiaoyu He and Yuval Wigderson.\n
LOCATION:https://researchseminars.org/talk/EPC/35/
END:VEVENT
END:VCALENDAR