18.226 Probabilistic Method in Combinatorics, Fall 2020

Author(s)
Zhao, Yufei
Thumbnail
DownloadThis package contains the same content as the online version of the course. (14.64Mb)
Terms of use
Attribution-NonCommercial-ShareAlike 3.0 United States http://creativecommons.org/licenses/by-nc-sa/3.0/us/
Metadata
Show full item record
Abstract
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. This course was previously numbered 18.218.
Date issued
2020
URI
https://hdl.handle.net/1721.1/157369
Department
Massachusetts Institute of Technology. Department of Mathematics
Other identifiers
18.226-Fall2020
18.226
Keywords
Mathematics - Discrete Mathematics, Mathematics - Probability and Statistics, Lecture Notes, Problem Sets, Instructor Insights
Collections

The following license files are associated with this item: