Dependent Random Choice - Mathematics > CombinatoricsReportar como inadecuado




Dependent Random Choice - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We describe a simple and yet surprisingly powerful probabilistic techniquewhich shows how to find in a dense graph a large subset of vertices in whichall or almost all small subsets have many common neighbors. Recently thistechnique has had several striking applications to Extremal Graph Theory,Ramsey Theory, Additive Combinatorics, and Combinatorial Geometry. In thissurvey we discuss some of them.



Autor: Jacob Fox, Benny Sudakov

Fuente: https://arxiv.org/







Documentos relacionados