We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO
< prev | next >
new | recent | 1212

Change to browse by:

math

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: Short proofs of some extremal results

Authors: David Conlon, Jacob Fox, Benny Sudakov
(Submitted on 6 Dec 2012 (v1), last revised 23 Aug 2013 (this version, v2))
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.
Comments: 19 pages
Subjects: Combinatorics (math.CO)
Cite as: arXiv:1212.1300 [math.CO]
  (or arXiv:1212.1300v2 [math.CO] for this version)

Submission history

From: David Conlon [view email]
[v1] Thu, 6 Dec 2012 11:56:01 GMT (20kb)
[v2] Fri, 23 Aug 2013 10:39:01 GMT (21kb)
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Link back to: arXiv, form interface, contact.