Short Proofs of Some Extremal Results
Name
Fox_Short proofs.pdf
Size
226.73 KB
Format
Adobe PDF
Checksum (MD5)
d5e0bddfe5a417f360f48940f030f186
Author(s)
Conlon, David
Fox, Jacob
Sudakov, Benny
Date Issued
November 2013
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1017/S0963548313000448
