Dependent Random Choice
Author(s)Fox, Jacob; Sudakov, Benny
MetadataShow full item record
We describe a simple and yet surprisingly powerful probabilistic technique which 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 to Extremal Graph Theory, Ramsey Theory, Additive Combinatorics, and Combinatorial Geometry. In this survey we discuss some of them.
DepartmentMassachusetts Institute of Technology. Department of Mathematics
Random Structures and Algorithms
Wiley Blackwell (John Wiley & Sons)
Fox, Jacob, and Benny Sudakov. “Dependent Random Choice.” Random Structures & Algorithms 38.1-2 (2011): 68–99. Web. 20 Apr. 2012. © 2010 Wiley Periodicals, Inc.
Author's final manuscript