Explore probabilistic methods in combinatorics through a 43-minute lecture focusing on establishing lower bounds for Ramsey numbers, featuring detailed explanations of the alteration/deletion method and the Lovász Local Lemma. Learn from MIT Professor Yufei Zhao as part of the Fall 2024 Probabilistic Methods in Combinatorics course, gaining insights into advanced mathematical concepts and their applications in combinatorial theory.
Lower Bounds to Ramsey Numbers - MIT 18.226 Probabilistic Methods in Combinatorics
MIT OpenCourseWare via YouTube
Related Courses
-
Probabilistic Methods in Combinatorics
-
Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
-
New Ramsey Multiplicity Bounds and Search Heuristics
-
Crossing Number Inequality in Graph Theory and Combinatorics
-
Threshold for a Random Graph to Contain a Triangle - MIT 18.226
-
Extremal Set Theory - Sperner's Theorem
