The alteration bound: expected number of monochromatic $k$-cliques in a uniformly random 2-coloring of $K_n$, namely $\binom{n}{k} \cdot 2 / 2^{\binom{k}{2}}$.
Instances For
Averaging principle: if $\sum_x f(x) \le \text{total}$ over a nonempty finite type, then some $x$ satisfies $f(x) \le \text{total} / |\alpha|$.
Counting indicator sums over colorings: the number of colorings making $S$ monochromatic with value $b$ equals $2^{\binom{n}{2} - \binom{|S|}{2}}$.
Simplification: dividing $\binom{n}{k} \cdot 2 \cdot 2^{\binom{n}{2} - \binom{k}{2}}$ by the total number of 2-colorings gives the alteration bound.
By averaging, there exists a 2-coloring of $K_n$ with at most alterationBound n k
monochromatic $k$-subsets.
(Theorem 1.1.6, Ramsey lower bound via the alteration method) For every $n, k$ with $k \le n$, there exists an $m \ge n - \text{alterationBound}(n, k)$ and a graph on $m$ vertices with no $k$-clique in $G$ or in $G^c$.