Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs

DOI10.1145/3406325.3451012arXiv2007.06360OpenAlexW3046229788MaRDI QIDQ6065277

Mehtaab Sawhney, Vishesh Jain, Ashwin Sah

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.06360

zbMATH Keywords

graph coloringcoupling from the pastperfect sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Perfect sampling from spatial mixing ⋮ Block symmetries in graph coloring reconfiguration systems ⋮ Exact distributed sampling

This page was built for publication: Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs