Anticoncentration in Ramsey Graphs and Proof of the Erdös-McKay Conjecture - Lecture

Anticoncentration in Ramsey Graphs and Proof of the Erdös-McKay Conjecture - Lecture

Explore recent advancements in graph theory and combinatorics through this 56-minute lecture from the USC Probability and Statistics Seminar. Delve into Lisa Sauermann's joint work with Matthew Kwan, Ashwin Sah, and Mehtaab Sawhney, which successfully proves the long-standing Erdös-McKay Conjecture. Gain insights into Ramsey graphs, their properties, and the significance of edge-statistics in random vertex subsets. Discover the innovative proof approach that led to solving this $100 problem posed by Erdös. Follow the speaker's explanation of the background on Ramsey graphs, the team's groundbreaking results, and the key concepts of anticoncentration in graph theory.