An improved method for recursively computing upper bounds for two-colour Ramsey numbers

Oliver Krüger

The two-colour Ramsey number $R(m,n)$ is the least natural number $p$ such that any graph of order $p$ must contain either a clique of size $m$ or an independent set of size $n$. W…