18.226 | Fall 2022 | Graduate

Probabilistic Methods in Combinatorics

Course Description

This course is a graduate-level introduction to the probabilistic methods, a fundamental and powerful technique in combinatorics and theoretical computer science. The essence of the approach is to show that some combinatorial object exists and prove that a certain random construction works with positive probability. …
This course is a graduate-level introduction to the probabilistic methods, a fundamental and powerful technique in combinatorics and theoretical computer science. The essence of the approach is to show that some combinatorial object exists and prove that a certain random construction works with positive probability. The course focuses on methodology as well as combinatorial applications.
Learning Resource Types
Instructor Insights
Online Textbook
Lecture Notes
Problem Sets
Photo of Paul Erdős wearing glasses.
Photo of Paul Erdős, a renowned Hungarian mathematician and the founder of the probabilistic method. (Image courtesy of Kmhkmh. Source: Wikimedia Commons. License CC BY.)