Short proofs of some extremal results
Combinatorics
2013-08-26 v2
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.
Keywords
Cite
@article{arxiv.1212.1300,
title = {Short proofs of some extremal results},
author = {David Conlon and Jacob Fox and Benny Sudakov},
journal= {arXiv preprint arXiv:1212.1300},
year = {2013}
}
Comments
19 pages