Ramsey theorem follows from R(s,t)≤R(s−1,t)+R(s,t−1): at a vertex, either at least R(s−1,t) neighbours or at least R(s,t−1) non-neighbours produce the desired clique or independent set. Induction with R(2,t)=R(s,2)=t gives R(s,t)≤(s−1s+t−2), hence R(t)≤(t−12t−2)<22t.