Marston Morse Lectures

Dependent random choice

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.

Date & Time

October 25, 2016 | 4:00pm – 5:00pm

Location

S-101

Speakers

Jacob Fox

Affiliation

Stanford University

Event Series

Categories