For all $k\in \mathbb{N}^{+},$ $R(k,1)=R(1,k)=1$ where $R(k,l)$ denotes a [[Ramsey Number on Two Colours|Ramsey number]]. **Proof**: Every non-empty graph has both a 1-clique and an independent set on 1 vertex