Published November 2016
| Submitted
Journal Article
Open
Short proofs of some extremal results II
- Creators
-
Conlon, David
- Fox, Jacob
- Sudakov, Benny
Abstract
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are quite short.
Additional Information
© 2016 Elsevier Inc. Received 2 July 2015; available online 6 April 2016. Conlon research supported by a Royal Society University Research Fellowship. Fox research supported by a Packard Fellowship, by NSF Career Award DMS-1352121 and by an Alfred P. Sloan Fellowship. Sudakov research supported by SNSF grant 200021-149111. We would like to thank the anonymous referees for their helpful remarks and Zoltan Füredi for bringing the reference [30] to our attention.Attached Files
Submitted - 1507.00547.pdf
Files
1507.00547.pdf
Files
(262.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:94eac8e39099d3c47565887988e633c9
|
262.8 kB | Preview Download |
Additional details
- Eprint ID
- 97844
- Resolver ID
- CaltechAUTHORS:20190812-163000938
- Royal Society
- David and Lucile Packard Foundation
- DMS-1352121
- NSF
- Alfred P. Sloan Foundation
- 200021-149111
- Swiss National Science Foundation (SNSF)
- Created
-
2019-08-13Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field