Wednesday, September 21, 2022 @ 4:30 PM - 5:30 PM KST Mehtaab Sawhney, Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED] An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if it has near-optimal Ramsey behavior). We study edge-statistics in Ramsey … Continue Reading
