arXiv Analytics

Sign in

arXiv:1507.00547 [math.CO]AbstractReferencesReviewsResources

Short proofs of some extremal results II

David Conlon, Jacob Fox, Benny Sudakov

Published 2015-07-02Version 1

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.

Comments: 21 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1212.1300 [math.CO] (Published 2012-12-06, updated 2013-08-23)
Short proofs of some extremal results
arXiv:1910.08661 [math.CO] (Published 2019-10-18)
Short proofs of some extremal results III
arXiv:2009.12692 [math.CO] (Published 2020-09-26)
Problems and results in Extremal Combinatorics -- IV

Links

Toolbox