Short proofs of some extremal results III
Combinatorics
2020-08-11 v3
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.
Cite
@article{arxiv.1910.08661,
title = {Short proofs of some extremal results III},
author = {David Conlon and Jacob Fox and Benny Sudakov},
journal= {arXiv preprint arXiv:1910.08661},
year = {2020}
}
Comments
27 pages, subsumes arXiv:1901.05084