Sampling Colorings with Fixed Color Class Sizes

Aiya Kuchukova, Will Perkins, Xavier Povill

In 1970 Hajnal and Szemerédi proved a conjecture of Erdös that for a graph with maximum degree $\hat{I}”$, there exists an equitable $\hat{I}”+1$ coloring; that is a coloring where color cla…