Marston Morse Lectures

Topic: Dependent random choice

Date & Time: Wednesday October 26th, 2016, 4:00pm - 5:00pm

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.

Speaker: Jacob Fox

Affiliation: Stanford University

Location: S-101

Video: https://video.ias.edu/marstonmorse/2016/1026-JacobFox