Short proofs of some extremal results
David Conlon, Jacob Fox, Benny Sudakov
TL;DR
This paper presents concise proofs for various extremal combinatorics results, addressing open problems across graph theory, Ramsey theory, and additive combinatorics, highlighting the elegance and simplicity of these solutions.
Contribution
It provides short, accessible proofs for several significant extremal combinatorics results, some of which solve open problems in the field.
Findings
Complete solutions to open problems in extremal graph theory
Partial solutions in Ramsey theory and additive combinatorics
Short proofs demonstrating the elegance of extremal combinatorics results
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory