Short proofs of some extremal results II
Combinatorics
2016-02-12 v2
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.
Cite
@article{arxiv.1507.00547,
title = {Short proofs of some extremal results II},
author = {David Conlon and Jacob Fox and Benny Sudakov},
journal= {arXiv preprint arXiv:1507.00547},
year = {2016}
}
Comments
21 pages