Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs

dc.contributor.author	Jain, Vishesh
dc.contributor.author	Sah, Ashwin
dc.contributor.author	Sawhney, Mehtaab
dc.date.accessioned	2022-10-21T17:32:00Z
dc.date.available	2022-10-21T17:32:00Z
dc.date.issued	2021-06-15
dc.identifier.isbn	978-1-4503-8053-9
dc.identifier.uri	https://hdl.handle.net/1721.1/145932
dc.publisher	ACM\|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.relation.isversionof	https://doi.org/10.1145/3406325.3451012	en_US
dc.rights	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.	en_US
dc.source	ACM\|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.title	Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs	en_US
dc.type	Article	en_US
dc.identifier.citation	Jain, Vishesh, Sah, Ashwin and Sawhney, Mehtaab. 2021. "Perfectly Sampling $k\geq (8/3 +o(1))\Delta$-Colorings in Graphs."
dc.contributor.department	Massachusetts Institute of Technology. Department of Mathematics
dc.identifier.mitlicense	PUBLISHER_POLICY
dc.eprint.version	Final published version	en_US
dc.type.uri	http://purl.org/eprint/type/ConferencePaper	en_US
eprint.status	http://purl.org/eprint/status/NonPeerReviewed	en_US
dc.date.updated	2022-10-20T14:19:03Z
dc.language.rfc3066	en
dc.rights.holder	The author(s)
dspace.date.submission	2022-10-20T14:19:03Z
mit.license	PUBLISHER_POLICY
mit.metadata.status	Authority Work and Publication Information Needed	en_US