 Uniform hypergraph Ramsey number

The diagonal $r$-uniform hypergraph Ramsey number $R^{(r)}(k)$ is the least $N$ such that every red-blue colouring of the $r$-element subsets of an $N$-element set has a monochromatic $k$-element set.