We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2 in Khot [14] .
For large enough k, it is NP-hard to colour a given k-colourable graph with 2 Ω(k 1/3 ) colours REF .
Improved Hardness of Approximating Chromatic Number
ArXiv
ArXiv
Mathematics Computer Science