  We give a short proof of the following theorem due to Jon H. Folkman (1969):
The chromatic number of any graph is at most $2$ plus the maximum over all
subgraphs of the difference between half the number of vertices and the
independence number.
