In this paper, we prove that the partial sums of the chromatic polynomial of a graph define an alternating sequence of upper and lower bounds.
