BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Lisa Sauermann (MIT)
DTSTART:20220908T141500Z
DTEND:20220908T160000Z
DTSTAMP:20260422T065841Z
UID:CJCS/83
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/83/">An
 ticoncentration in Ramsey graphs and a proof of the Erdös-McKay Conjectur
 e</a>\nby Lisa Sauermann (MIT) as part of Copenhagen-Jerusalem Combinatori
 cs Seminar\n\n\nAbstract\nThis talk will discuss recent joint work with Ma
 tthew Kwan\, Ashwin Sah\, and Mehtaab Sawhney\, proving an old conjecture 
 of Erdös and McKay (for which Erdős offered $100). This conjecture conce
 rns Ramsey graphs\, which are (roughly speaking) graphs without large comp
 lete or empty subgraphs. In order to prove the conjecture\, we study edge-
 statistics in Ramsey graphs\, i.e. we study the distribution of the number
  of edges in a random vertex subset of a Ramsey graph. After discussing so
 me background on Ramsey graphs\, the talk will explain our results and giv
 e an overview of our proof approach.\n
LOCATION:https://researchseminars.org/talk/CJCS/83/
END:VEVENT
END:VCALENDAR