Shahrzad Haddadan

Learn More
In 1995, Jerrum proved a rapid mixing property on a certain Markov chain to solve the problem of sampling uniformly at random from the set of all proper k-colorings on a graph with maximum degree ∆. Jerrum’s proof was for the colorings for which k > 2∆. In 1999, Vigoda improved this bound to k > 11 6 ∆. There has been no improvement for this problem after(More)
  • 1