This is an advanced graduate class on probabilistic combinatorics. Familiarity with basic tools in discrete probabilistic methods (e.g. things in this book) will be assumed.

Instructor: Jinyoung Park (jinypark at stanford dot edu)

Time: Monday, Wednesday, Friday 9:45 am - 10:45 am

Location: McCullough Building, Room 122

Textbooks: there is no mandatory textbook. We will mostly discuss research papers, some of which are listed below. Some related materials can be found in:

• Alon, Spencer The Probabilistic Method

• Janson, Łuczak, Rucinski Random Graphs

Below is a tentative (and not-exhaustive) list of papers that we will discuss in class.

• Bernshteyn The Johansson-Molloy Theorem for DP-Coloring

• Davies, Jenssen, Perkins, Roberts On the average size of independent sets in triangle-free graphs

• Frankston, Kahn, Narayanan, Park Thresholds versus fractional expectation-thresholds

• Harel, Mousset, Samotij Upper tails via high moments and entropic stability

• Moser, Tardos A constructive proof of the general Lovász Local Lemma

• Riordan Random cliques in random graphs