For all $k\in\mathbb{N},$ $R(k,k)\leq {2k-2 \choose k-1} \leq 2^{2k}=4^{k}.$ ###### Proof Follow directly from [[Upper bound for Ramsey Numbers on Two Colours (Ramsey's Theorem)]].