Minimum-degree Ramsey lower bound

If a graph $H$ has minimum degree $d$, then its graph Ramsey number satisfies $R(H)\ge 2^{d/2}$. The probabilistic proof chooses a red-blue edge colouring and applies the local lemma to its monochromatic copies of $H$.