This textbook introduces probabilistic techniques for proving existence and structure in combinatorics. With examples and modern tools, readers analyze randomness, derive tight estimates, and apply methods across graphs and hypergraphs. 

Key Topics

• Linearity of expectation
• Second moment method
• Chernoff bounds
• Lovász local lemma
• Hypergraph containers

Author: Yufei Zhao