arXiv (All)
open access
Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric
We present improved bounds for randomly sampling $k$-colorings of graphs with maximum degree $Δ$; our results hold without any further structural assumptions on the graph. The Glauber dynamics is a simple single-site update Markov chain. Jerrum (1995) proved an optimal $O(n\log{n})$ mixing-time boun
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling#1117362
- k-Coloring is Faster than Computing the Chromatic Number#987763
- Sampling Line-Graph Colorings with Constant Extra Colors#1063651
- Thresholds and Fluctuations for Colorful Arithmetic Progressions in Sparse Random Colorings#1084973
- More Efficient Parallel $(Δ+1)$-Edge Coloring#1130345
Record · ID 1062747
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive