A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Improved Hardness of Approximating Chromatic Number
[chapter]
2013
Lecture Notes in Computer Science
We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2 K 1/3 colors. This improves the previous result of K versus K O(log K) in Khot [14] .
doi:10.1007/978-3-642-40328-6_17
fatcat:nqgtmn7hrbbfbisaxzzhpsozjy