Recognition: unknown
Short proofs of some extremal results
classification
🧮 math.CO
keywords
extremalresultsareascombinatoricsproofsshorttheoryadditive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.