Indexed metadata
Short Proofs of Some Extremal Results
DAVID CONLON, JACOB FOX, BENNY SUDAKOV
Source record
Source: Crossref
Published: Nov 4, 2013
DOI: 10.1017/s0963548313000448
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.