We consider the problem of sampling uniformly at random from the set of proper k-colorings of a graph with maximum degree Δ. Our main result is the design of a simple Markov chain that converges in O(nk log n) time to the desired distribution when k>116Δ.
No takes yet. Share an insight, caveat, or question.
Eric Vigoda (2000) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: