Published January 2014
| Submitted + Published
Journal Article
Open
Short Proofs of Some Extremal Results
- Creators
-
Conlon, David
- Fox, Jacob
- Sudakov, Benny
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.
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
1212.1300.pdf
Files
(455.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d5e0bddfe5a417f360f48940f030f186
|
232.2 kB | Preview Download |
|
md5:5b0c0f9fb5116359d5835eeb7a4e1623
|
223.5 kB | Preview Download |
Additional details
- Eprint ID
- 97805
- Resolver ID
- CaltechAUTHORS:20190812-162956937
- Royal Society
- Simons Foundation
- NSF
- DMS-1069197
- NSF
- DMS-1101185
- Air Force Office of Scientific Research (AFOSR)
- FA9550-10-1-0569
- Binational Science Foundation (USA-Israel)
- Created
-
2019-08-13Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field