Dependent Random Choice
Author(s)
Fox, Jacob; Sudakov, Benny
DownloadFox_Dependent Random.pdf (221.2Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010-11Department
Massachusetts Institute of Technology. Department of MathematicsJournal
Random Structures and Algorithms
Publisher
Wiley Blackwell (John Wiley & Sons)
Citation
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.
Version: Author's final manuscript
ISSN
1042-9832
1098-2418