Short proofs of some extremal results II

2015/07/02 by Conlon, David, Fox, Jacob, Sudakov, Benny · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1507.00547

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.

Cited by

• Ramsey numbers of digraphs with local edge structure

Related

• Short proofs of some extremal results III
• Short proofs of some extremal results
• Problems and results in Extremal Combinatorics -- IV
• Refuting conjectures in extremal combinatorics via linear programming
• Embedding graphs into larger graphs: results, methods, and problems