2 citations · 2 across the 4 of their papers we have counts for
4 papers
Hypergraph Ramsey numbers
David Conlon, Jacob Fox, Benny Sudakov
The Ramsey number r_k(s,n) is the minimum N such that every red-blue coloring of the k-tuples of an N-element set contains either a red set of size s or a blue set of size n, where…
A note on lower bounds for hypergraph Ramsey numbers
David Conlon
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform case, that \[r_3 (l,l,l) \geq 2^{l^{c \log \log l}}.\] The old bound, due to Erdős…
On the Ramsey multiplicity of complete graphs
David Conlon
We show that, for large, there must exist at least \[\frac{n^t}{C^{(1+o(1))t^2}}\] monochromatic s in any two-colouring of the edges of , where is an…
Ramsey numbers of sparse hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree Δhas Ramsey number at most c(Δ, k)n, for an appropriate constant c(Δ, k). This result was re…