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...
Main Authors: | Fox, Jacob (Contributor), Sudakov, Benny (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Wiley Blackwell (John Wiley & Sons),
2012-04-20T21:52:44Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Chromatic number, clique subdivisions, and the conjectures of Hajos and Erdos-Fajtlowicz
by: Fox, Jacob, et al.
Published: (2012) -
On two problems in graph Ramsey theory
by: Conlon, David, et al.
Published: (2012) -
Maximum union-free subfamilies
by: Fox, Jacob, et al.
Published: (2012) -
Erdos-Hajnal-type theorems in hypergraphs
by: Conlon, David, et al.
Published: (2015) -
Cycle packing
by: Conlon, David, et al.
Published: (2015)