Dependent Random Choice
Name
Fox_Dependent Random.pdf
Size
221.26 KB
Format
Adobe PDF
Checksum (MD5)
af99ccbd9dbc753e4ad26f5feac9c9d4
Author(s)
Fox, Jacob
Sudakov, Benny
Date Issued
November 2010
Journal
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
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1002/rsa.20344
