Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs
Name
3406325.3451012.pdf
Size
762.97 KB
Format
Adobe PDF
Checksum (MD5)
045f8b59911f3d33a1d3026a9ba89949
Author(s)
Jain, Vishesh
Sah, Ashwin
Sawhney, Mehtaab
Date Issued
June 15, 2021
Publisher
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Citation
Jain, Vishesh, Sah, Ashwin and Sawhney, Mehtaab. 2021. "Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3406325.3451012
