18.218 Probabilistic Method in Combinatorics, Spring 2019

18.218 Probabilistic Method in Combinatorics, Spring 2019

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 posit...

Full description

Bibliographic Details
Main Author: Zhao, Yufei
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Learning Object
Language:en-US
Published: 2023
Subjects:
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
Online Access:https://hdl.handle.net/1721.1/151192

Internet

https://hdl.handle.net/1721.1/151192

Similar Items