Coursera Plus Annual is 40% Off — Ends July 6.

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

MIT OpenCourseWare

Lower Bounds to Ramsey Numbers - MIT 18.226 Probabilistic Methods in Combinatorics

MIT OpenCourseWare via YouTube

Start learning Write review
Coursera Ad

AI, Data Science & Cloud Certificates from Google, IBM & Meta

Learn More → Boot.dev Ad

The Most Addictive Python and SQL Courses

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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

Tags

Reviews

Start your review of Lower Bounds to Ramsey Numbers - MIT 18.226 Probabilistic Methods in Combinatorics

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.