VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Probabilistic Methods in Combinatorics
Last Updated: 2026-02-05 16:14:51
Abstract
This course provides a gentle introduction to the Probabilistic Method, with an emphasis on methodology. We will try to illustrate the main ideas by showing the application of probabilistic reasoning to various combinatorial problems.
Content
The topics covered in the class will include (but are not limited to): linearity of expectation, the second moment method, the local lemma, correlation inequalities, martingales, large deviation inequalities, Janson and Talagrand inequalities and pseudo-randomness.
Resources
Literature
- The Probabilistic Method, by N. Alon and J. H. Spencer, 3rd Edition, Wiley, 2008. - Random Graphs, by B. Bollobás, 2nd Edition, Cambridge University Press, 2001. - Random Graphs, by S. Janson, T. Luczak and A. Rucinski, Wiley, 2000. - Graph Coloring and the Probabilistic Method, by M. Molloy and B. Reed, Springer, 2002.
General Information
- Language
- English
- Levels
- DR
- Frequency
- Every two years
Examination
- Type
- ungraded semester performance
Registration & Places
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture |
Probabilistic Methods in Combinatorics
Does not take place this semester.
|
No time listed | 2 h weekly |
| exercise |
Probabilistic Methods in Combinatorics
Does not take place this semester.
|
No time listed | 1 h weekly |
Offered In
-
Doctorate Mathematics (More Information at: )
-
Subject Specialisation (The list of courses (together with the allocated credit points) eligible for doctoral students is published each semester in the newsletter of the ZGSM.)
-
Graduate School (Official website of the Zurich Graduate School in Mathematics: )
-
-