18.218 Probabilistic Method in Combinatorics, Spring 2019
Author(s)
Zhao, Yufei
Download18-218-spring-2019/contents/index.htm (34.13Kb)
Alternative title
Probabilistic Method in Combinatorics
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2019-06Other identifiers
18.218-Spring2019
Other identifiers
18.218
IMSCP-MD5-0282d72460e569d6f4bd54e8bbdcfeab
Keywords
probabilistic method, Ramsey numbers, Lovász Local Lemma, hypergraph colorings, balancing vectors, sum-free sets, second Moment Method, Chernoff bound, Moser-Tardos algorithm, Janson’s inequalities, Harris-FKG inequality, Martingale convergence, Azuma’s inequality, entropy methods, occupancy method
Collections
The following license files are associated with this item: