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

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3406325.3451012 ◽

2021 ◽

Author(s):

Vishesh Jain ◽

Ashwin Sah ◽

Mehtaab Sawhney

Download Full-text