5 research outputs found
Short proofs of some extremal results III
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
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
see the abstract in the attached pd