Randomly coloring graphs of logarithmically bounded pathwidth

Shai Vardi (1)

1 Purdue University [West Lafayette]

We consider the problem of sampling a proper k-coloring of a graph of maximal degree ∆ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of logarithmically bounded pathwidth if k ≥ (1 +)∆, for any > 0, using a new hybrid paths argument.

Domaines: Informatique [cs]

Shai Vardi. Randomly coloring graphs of logarithmically bounded pathwidth. 2018. ⟨hal-01832102⟩