A short and useful theorem in combinatorics.
Graph containers & bounds on the number of independent sets in a locally dense graph.
umcconnell