Randomly coloring graphs of logarithmically bounded pathwidth - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2018

Randomly coloring graphs of logarithmically bounded pathwidth

Shai Vardi
  • Function : Author
  • PersonId : 1034125

Abstract

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.
Fichier principal
Vignette du fichier
ColoringPathwidth.pdf (431.48 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01832102 , version 1 (06-07-2018)

Identifiers

  • HAL Id : hal-01832102 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More