| dc.contributor.author | Fox, Jacob | |
| dc.contributor.author | Sudakov, Benny | |
| dc.date.accessioned | 2012-04-20T21:52:44Z | |
| dc.date.available | 2012-04-20T21:52:44Z | |
| dc.date.issued | 2010-11 | |
| dc.date.submitted | 2009-09 | |
| dc.identifier.issn | 1042-9832 | |
| dc.identifier.issn | 1098-2418 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/70097 | |
| dc.description.abstract | 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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). Graduate Research Fellowship Program | en_US |
| dc.description.sponsorship | Princeton University (Centennial Fellowship) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). (CAREER award DMS-0812005) | en_US |
| dc.description.sponsorship | U.S.-Israel Binational Science Foundation (BSF) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Wiley Blackwell (John Wiley & Sons) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1002/rsa.20344 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Dependent Random Choice | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Fox, Jacob, and Benny Sudakov. “Dependent Random Choice.” Random Structures & Algorithms 38.1-2 (2011): 68–99. Web. 20 Apr. 2012. © 2010 Wiley Periodicals, Inc. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.approver | Fox, Jacob | |
| dc.contributor.mitauthor | Fox, Jacob | |
| dc.relation.journal | Random Structures and Algorithms | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Fox, Jacob; Sudakov, Benny | en |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
