Dependent random choice

: 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. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 38, 68–99, 2011

• Type: Journal
• Year: 2011
• Where: RSA
• Authors: Jacob Fox, Benny Sudakov
• Keywords: Dense Graph, Extremal Graph Theory, Powerful Probabilistic Technique, RSA 2011