BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ashwin Sah (MIT)
DTSTART:20200528T170000Z
DTEND:20200528T180000Z
DTSTAMP:20260423T021118Z
UID:WAC/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WAC/2/">Diag
 onal Ramsey via effective quasirandomness</a>\nby Ashwin Sah (MIT) as part
  of Webinar in Additive Combinatorics\n\n\nAbstract\nWe improve the upper 
 bound for diagonal Ramsey numbers to\n\\[\nR(k+1\,k+1)\\le\\exp(-c(\\log k
 )^2)\\binom{2k}{k}\n\\]\nfor $k\\ge 3$. To do so\, we build on a quasirand
 omness and induction framework for Ramsey numbers introduced by Thomason a
 nd extended by Conlon\, demonstrating optimal ``effective quasirandomness'
 ' results about convergence of graphs. This optimality represents a natura
 l barrier to improvement.\n
LOCATION:https://researchseminars.org/talk/WAC/2/
END:VEVENT
END:VCALENDAR