Conditional hardness for approximate coloring

We study the APPROXIMATE-COLORING(q, Q) problem: Given a graph G, decide whether χ(G) ≤ q or χ(G) ≥ Q (where χ(G) is the chromatic number of G). We derive conditional hardness for this problem for any constant 3 ≤ q < Q. For q ≥ 4, our result is based on Khot's 2-to-1 conjecture (Khot'02). For q = 3, we base our hardness result on a certain '⊲< shaped' variant of his conjecture. We also prove that the problem ALMOST-3-COLORING" is hard for any constant ε > 0, assuming Khot's Unique Games conjecture. This is the problem of decid ing for a given graph, between the case where one can 3-color all but a ε fraction of the vertices without monochromatic edges, and the case where the graph contains no independent set of relative size at least ε. Our result is based on bounding various generalized noise-stability quantities using the invariance principle of Mossel et al (MOO'05).