Short Proofs of Some Extremal Results

Short Proofs of Some Extremal Results

We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the...

Full description

Bibliographic Details
Main Authors: Conlon, David (Author), Fox, Jacob (Contributor), Sudakov, Benny (Author)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Cambridge University Press, 2015-01-14T18:13:00Z.
Subjects:
Article
Online Access:Get fulltext
Description
Summary:We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.
Royal Society (Great Britain) (University Research Fellowship)
Simons Foundation (Fellowship)
National Science Foundation (U.S.) (Grant DMS-1069197)
National Science Foundation (U.S.) (Grant DMS-1101185)
United States. Army Research Office. Multidisciplinary University Research Initiative (grant FA9550-10-1-0569)
United States-Israel Binational Science Foundation (grant)

Similar Items