Dependent Random Choice [article]

Jacob Fox, Benny Sudakov
2010 arXiv   pre-print
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.
arXiv:0909.3271v2 fatcat:affwyxeo7jeehpqdmtgz335ksy