Add to ORKGWe improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform case, that r_(3)(l, l, l) ≥ 2^(l^(c log log l)). The old bound, due to Erdős and Hajnal, was r_(3)(l, l, l) ≥ 2^(cl^(2) log^(2) l)
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
The Ramsey number r_(k)(s, n) is the minimum N such that every red-blue coloring of the k-tuples of ...
The Ramsey number r_(k)(s, n) is the minimum N such that every red-blue coloring of the k-tuples of ...
Resolving a problem of Conlon, Fox, and R\"{o}dl, we construct a family of hypergraphs with arbitrar...
The partition relation N → (n)^(k)_(ℓ) means that whenever the k-tuples of an N-element set are ℓ-co...
We show that for all ℓ and ε > 0 there is a constant c = c(ℓ, ε) > 0 such that every ℓ-coloring of t...
Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-u...
Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every...
We give a short proof that any k‐uniform hypergraph H on n vertices with bounded degree Δ has Ramsey...
AbstractThis work deals with a classical combinatorial problem of P. Erdős and A. Hajnal concerning ...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
We improve upon the lower bound for 3-colour hypergraph Ramsey numbers, showing, in the 3-uniform ca...
The Ramsey number r_(k)(s, n) is the minimum N such that every red-blue coloring of the k-tuples of ...
The Ramsey number r_(k)(s, n) is the minimum N such that every red-blue coloring of the k-tuples of ...
Resolving a problem of Conlon, Fox, and R\"{o}dl, we construct a family of hypergraphs with arbitrar...
The partition relation N → (n)^(k)_(ℓ) means that whenever the k-tuples of an N-element set are ℓ-co...
We show that for all ℓ and ε > 0 there is a constant c = c(ℓ, ε) > 0 such that every ℓ-coloring of t...
Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-u...
Given an r-uniform hypergraph H, the multicolor Ramsey number rk(H) is the minimum n such that every...
We give a short proof that any k‐uniform hypergraph H on n vertices with bounded degree Δ has Ramsey...
AbstractThis work deals with a classical combinatorial problem of P. Erdős and A. Hajnal concerning ...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers gr...
Given a hypergraph H, the size-Ramsey number ˆr2(H) is the smallest integer m such that there exists...