@InProceedings{guruswami_et_al:LIPIcs.ICALP.2020.62, author = {Guruswami, Venkatesan and Sandeep, Sai}, title = {{d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {62:1--62:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.62}, URN = {urn:nbn:de:0030-drops-124694}, doi = {10.4230/LIPIcs.ICALP.2020.62}, annote = {Keywords: graph coloring, hardness of approximation} }