Venkatesan Guruswami, Sai Sandeep. $d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Electronic Colloquium on Computational Complexity (ECCC), 26:116, 2019. [doi]
@article{GuruswamiS19a,
title = {$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors},
author = {Venkatesan Guruswami and Sai Sandeep},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/116},
researchr = {https://researchr.org/publication/GuruswamiS19a},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {26},
pages = {116},
}