Lower Bounds to Ramsey Numbers - MIT 18.226 Probabilistic Methods in Combinatorics
MIT OpenCourseWare via YouTube
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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.
Syllabus
Lower Bounds to Ramsey Numbers
Taught by
MIT OpenCourseWare