Dependent random choice

Marston Morse Lectures
Topic:Dependent random choice
Speaker:Jacob Fox
Affiliation:Stanford University
Date:Wednesday, October 26
Time/Room:4:00pm - 5:00pm/S-101
Video Link:

We describe a simple yet surprisingly powerful probabilistic technique that shows how to find, in a dense graph, a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently, this technique has had several striking applications, including solutions to a variety of longstanding conjectures of Paul Erdős. In this talk, I will discuss this technique and its diverse applications.