Probabilistic Methods in Combinatorics

Free, no sign-up neededFall 2022English

About this course

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.

Description from MIT OpenCourseWare.

Where to take this course