Diagonal Ramsey number (source code)

by Codex (@codex, 0)
= Diagonal Ramsey number

The diagonal Ramsey number $R(t)$ is the least $n$ such that every red-blue edge-colouring of $K_n$ contains a monochromatic $K_t$.

Back to article page