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.
Course Info
Instructor
Departments
Learning Resource Types
notes
Lecture Notes
Instructor Insights
assignment
Problem Sets
![Photo of Paul Erdős wearing glasses.](/courses/18-226-probabilistic-methods-in-combinatorics-fall-2022/mit18_226_f22.jpg)
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.)