Home


Lisa Sauermann, MIT

Abstract: This talk will discuss recent joint work with Matthew Kwan, Ashwin Sah, and Mehtaab Sawhney, proving an old conjecture of Erdös and McKay (for which Erdős offered $100). This conjecture concerns Ramsey graphs, which are (roughly speaking) graphs without large complete 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 some background on Ramsey graphs, the talk will explain our results and give an overview of our proof approach.

 

Event Details

  • Yixuan Liu

1 person is interested in this event


Zoom Meeting: https://usc.zoom.us/j/96089285570?pwd=T0szRitVSjIrYUpYeGVoc2FsYmM2UT09

Meeting ID: 960 8928 5570
Passcode: 234597

User Activity

No recent activity