Dependent Random Choice

Speaker


Jacob Fox (Stanford University)
Date
Fri January 24th 2014, 3:30pm
Event Sponsor
Mathematics Research Center
Location
Building 380, Room 380C
MRC Event Series

We describe a simple and 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.