Skip to content
Preprint

Sampling Line-Graph Colorings with Constant Extra Colors

Sep 2026 · 0 citations · 15 references
Computer Science Mathematics

Abstract

Let $G$ be the line graph of a finite simple graph, with $n\geq1$ vertices and maximum degree $\Delta$. We prove that single-site Glauber dynamics for uniform proper $q$-colorings mixes in $O_\Delta(n\log(n/\varepsilon))$ steps for every integer $q\geq\Delta+5$. Our proof uses the Bochner framework of Chen and Liu (2026).

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.