Improved Hardness of Approximating Chromatic Number
Abstract
We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2K1/3 colors. This improves the previous result of K versus KO(log K) in Khot [14].
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.