A Hajnal-Szemerédi Theorem for Skewed Colorings

The Hajnal-Szemerédi theorem guarantees an equitable $(r+1)$-coloring of every graph of maximum degree at most $r$. We prove a version of this result for more general prescribed color class sizes, subject only to a natural upper bound.