Short Proofs of Some Extremal Results

Author(s)
Conlon, David; Fox, Jacob; Sudakov, Benny
Thumbnail
DownloadFox_Short proofs.pdf (226.7Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
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.
Date issued
2013-11
URI
http://hdl.handle.net/1721.1/92861
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Combinatorics, Probability and Computing
Publisher
Cambridge University Press
Citation
Conlon, David, Jacob Fox, and Benny Sudakov. “Short Proofs of Some Extremal Results.” Combinatorics, Probability and Computing 23, no. 01 (January 2014): 8–28.
Version: Original manuscript
ISSN
0963-5483
1469-2163
Collections