Dependent Random Choice

Details Dependent Random Choice Dependent Random Choice

2009-09-17

arxiv.org/abs/0909.3271v2

Mathematics

Combinatorics

32 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dependent Random Choice does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dependent Random Choice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependent Random Choice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391614