66 citations · 544 across the 74 of their papers we have counts for
4 papers · 1 filter
The Ramsey number of dense graphs
David Conlon
The Ramsey number r(H) of a graph H is the smallest number n such that, in any two-colouring of the edges of K_n, there is a monochromatic copy of H. We study the Ramsey number of…
An improved bound for the stepping-up lemma
David Conlon, Jacob Fox, Benny Sudakov
The partition relation N \to (n)_{\ell}^k means that whenever the k-tuples of an N-element set are \ell-colored, there is a monochromatic set of size n, where a set is called monoc…
On-line Ramsey numbers
David Conlon
Consider the following game between two players, Builder and Painter. Builder draws edges one at a time and Painter colours them, in either red or blue, as each appears. Builder's…
Large almost monochromatic subsets in hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
We show that for all and there is a constant such that every -coloring of the triples of an -element set contains a subset of size $c\sqrt…