Published December 2020
| Submitted
Journal Article
Open
Short proofs of some extremal results III
- Creators
-
Conlon, David
- Fox, Jacob
- Sudakov, Benny
Abstract
We prove a selection of 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 reasonably short.
Additional Information
© 2020 Wiley Periodicals LLC. Issue Online: 25 October 2020; Version of Record online: 30 August 2020; Manuscript accepted: 02 June 2020; Manuscript received: 20 October 2019. This research was supported by the ERC Starting Grant, 676632 (D.C.). NSF Award, DMS‐1855635. Alfred P. Sloan Fellowship (J.F.), SNSF grant, 200021‐175573 (B.S.). Section 2 was first written in May 2015, predating a recent paper of Geneson [41] showing that T_k ≤ k^(5/2+o(1)). More recently J. Balogh, W. Linz and L. Mattos [9] independently investigated the question of estimating T_k and showed that T_k = k^(2+o(1)) (which is slightly weaker than Corollary 2.4). We would like to thank Kevin Ford for some helpful discussions on this theme and also thank the anonymous referees for their careful reading of the paper and useful suggestions.Attached Files
Submitted - 1910.08661.pdf
Files
1910.08661.pdf
Files
(323.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a022025d515dad9983c324856661850d
|
323.4 kB | Preview Download |
Additional details
- Eprint ID
- 105284
- Resolver ID
- CaltechAUTHORS:20200909-070916091
- 676632
- European Research Council (ERC)
- DMS‐1855635
- NSF
- Alfred P. Sloan Foundation
- 200021‐175573
- Swiss National Science Foundation (SNSF)
- Created
-
2020-09-09Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field