Short proofs of some extremal results III

Thumbnail
Metadata only
Author
Conlon, David
Fox, Jacob
Sudakov, Benny
Date
2020-12
Type
    Conference Paper
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 Show more
Publication status
published
External links
Book title
Proceedings of the Nineteenth International Conference “Random Structures and Algorithms” held 15–19 July, 2019, Zürich, Switzerland
Journal / series
Random Structures & Algorithms
Volume
57(4)
Pages / Article No.
958 - 982
Publisher
Wiley
Event
19th International Conference on Random Structures and Algorithms, Zurich, Switzerland, July 15-19, 2019
Subject
extremal graph theory; Ramsey theory; Random graphs
Organisational unit
03993 - Sudakov, Benjamin / Sudakov, Benjamin  
Funding
175573 - Extremal problems in combinatorics (SNF)
More
Show all metadata
Citations
Cited 1 times in Web of Science
Cited 1 times in Scopus
ETH Bibliography
yes
Altmetrics