Probabilistic Method in Combinatorics

Photo of a man 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.)

Instructor(s)

MIT Course Number

18.218

As Taught In

Spring 2019

Level

Graduate

Cite This Course

Course Description

Course Features

Course Description

This course is a graduate-level introduction to the probabilistic method, 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.

Related Content

Yufei Zhao. 18.218 Probabilistic Method in Combinatorics. Spring 2019. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu. License: Creative Commons BY-NC-SA.


For more information about using these materials and the Creative Commons license, see our Terms of Use.


Close