Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2014 | Submitted + Published
Journal Article Open

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 relevant proofs are quite short.

Additional Information

© Cambridge University Press 2013. Received 6 December 2012; revised 9 September 2013; first published online 4 November 2013. Conlon research supported by a Royal Society University Research Fellowship. Fox research supported by a Simons Fellowship and NSF grant DMS-1069197. Sudakov research supported in part by NSF grant DMS-1101185, by AFOSR MURI grant FA9550-10-1-0569 and by a USA–Israel BSF grant.

Attached Files

Published - short_proofs_of_some_extremal_results.pdf

Submitted - 1212.1300.pdf


Files (455.7 kB)
Name Size Download all
232.2 kB Preview Download
223.5 kB Preview Download

Additional details

August 19, 2023
October 18, 2023