Off-diagonal graph Ramsey number
= Off-diagonal graph Ramsey number
{title2=$r(G,H)$}
The Ramsey number $r(G,H)$ is the least $n$ such that every red-blue colouring of $K_n$ contains a red copy of $G$ or a blue copy of $H$.
= Off-diagonal graph Ramsey number
{title2=$r(G,H)$}
The Ramsey number $r(G,H)$ is the least $n$ such that every red-blue colouring of $K_n$ contains a red copy of $G$ or a blue copy of $H$.