New Hardness Results for Graph and Hypergraph Colorings

Authors Joshua Brakensiek, Venkatesan Guruswami

Thumbnail PDF


  • Filesize: 0.62 MB
  • 27 pages

Document Identifiers

Author Details

Joshua Brakensiek
Venkatesan Guruswami

Cite AsGet BibTex

Joshua Brakensiek and Venkatesan Guruswami. New Hardness Results for Graph and Hypergraph Colorings. In 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 50, pp. 14:1-14:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Finding a proper coloring of a t-colorable graph G with t colors is a classic NP-hard problem when t >= 3. In this work, we investigate the approximate coloring problem in which the objective is to find a proper c-coloring of G where c >= t. We show that for all t >= 3, it is NP-hard to find a c-coloring when c <= 2t-2. In the regime where t is small, this improves, via a unified approach, the previously best known hardness result of c <= max{2t- 5, t + 2*floor(t/3) - 1} (Garey and Johnson 1976; Khanna, Linial, Safra, 1993; Guruswami, Khanna, 2000). For example, we show that 6-coloring a 4-colorable graph is NP-hard, improving on the NP-hardness of 5-coloring a 4-colorable graph. We also generalize this to related problems on the strong coloring of hypergraphs. A k-uniform hypergraph H is t-strong colorable (where t >= k) if there is a t-coloring of the vertices such that no two vertices in each hyperedge of H have the same color. We show that if t = ceiling(3k/2), then it is NP-hard to find a 2-coloring of the vertices of H such that no hyperedge is monochromatic. We conjecture that a similar hardness holds for t=k+1. We establish the NP-hardness of these problems by reducing from the hardness of the Label Cover problem, via a "dictatorship test" gadget graph. By combinatorially classifying all possible colorings of this graph, we can infer labels to provide to the label cover problem. This approach generalizes the "weak polymorphism" framework of (Austrin, Guruswami, Hastad, 2014), though interestingly our results are "PCP-free" in that they do not require any approximation gap in the starting Label Cover instance.
  • hardness of approximation
  • graph coloring
  • hypergraph coloring
  • polymor- phisms
  • combinatorics


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. N. Alon, I. Dinur, E. Friedgut, and B. Sudakov. Graph products, fourier analysis and spectral techniques. Geometric &Functional Analysis GAFA, 14(5):913-940, 2004. URL:
  2. Noga Alon. personal communication, Oct 2014. Google Scholar
  3. Per Austrin, Venkatesan Guruswami, and Johan Håstad. (2 + epsilon)-SAT is NP-hard. In Proceedings of the 55th IEEE Symposium on Foundations of Computer Science, pages 1-10, Oct 2014. Google Scholar
  4. Andrei A. Bulatov, Peter Jeavons, and Andrei A. Krokhin. Classifying the complexity of constraints using finite algebras. SIAM J. Comput., 34(3):720-742, 2005. Google Scholar
  5. Irit Dinur and Venkatesan Guruswami. PCPs via low-degree long code and hardness for constrained hypergraph coloring. In Proceedings of the 54th Annual Symposium on Foundations of Computer Science (FOCS), pages 340-349, October 2013. Google Scholar
  6. Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. SIAM Journal on Computing, 39(3):843-873, 2009. URL:
  7. Irit Dinur, Oded Regev, and Clifford Smyth. The hardness of 3-uniform hypergraph coloring. Combinatorica, 25(5):519-535, September 2005. URL:
  8. Irit Dinur and Igor Shinkar. On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors. In Maria Serna, Ronen Shaltiel, Klaus Jansen, and José Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 6302 of Lecture Notes in Computer Science, pages 138-151. Springer Berlin Heidelberg, 2010. URL:
  9. M. R. Garey and David S. Johnson. The complexity of near-optimal graph coloring. Journal of the ACM, 23(1):43-49, 1976. Google Scholar
  10. D. Greenwell and L. Lovász. Applications of product colouring. Acta Mathematica Academiae Scientiarum Hungarica, 25(3-4):335-340, 1974. URL:
  11. Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, and Girish Varma. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. In Proceedings of the 46th ACM Symposium on Theory of Computing (STOC), pages 614-623, 2014. Google Scholar
  12. Venkatesan Guruswami, Johan Håstad, and Madhu Sudan. Hardness of approximate hypergraph coloring. SIAM Journal on Computing, 31(6):1663-1686, 2002. Google Scholar
  13. Venkatesan Guruswami and Sanjeev Khanna. On the hardness of 4-coloring a 3-colorable graph. SIAM J. Discrete Math., 18(1):30-40, 2004. Google Scholar
  14. Venkatesan Guruswami and Euiwoong Lee. Strong inapproximability results on balanced rainbow-colorable hypergraphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 822-836, 2015. Google Scholar
  15. Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, and Yi Wu. Bypassing ugc from some optimal geometric inapproximability results. In Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'12, pages 699-717. SIAM, 2012. URL:
  16. Johan Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001. Google Scholar
  17. Jonas Holmerin. Vertex cover on 4-regular hypergraphs is hard to approximate within 2-epsilon. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, pages 544-552, 2002. Google Scholar
  18. Sangxia Huang. Approximation resistance on satisfiable instances for predicates with few accepting inputs. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC'13, pages 457-466, New York, NY, USA, 2013. ACM. URL:
  19. Sangxia Huang. Improved hardness of approximating chromatic number. In Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, and JoséD.P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 8096 of Lecture Notes in Computer Science, pages 233-243. Springer Berlin Heidelberg, 2013. URL:
  20. Sangxia Huang. 2^(log N)^1/10-o(1) hardness for hypergraph coloring. Electronic Colloquium on Computational Complexity (ECCC), 22:62, 2015. URL:
  21. Sanjeev Khanna, Nathan Linial, and Shmuel Safra. On the hardness of approximating the chromatic number. Combinatorica, 20(3):393-415, 2000. Google Scholar
  22. S. Khot. Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, pages 600-609, Oct 2001. URL:
  23. Subhash Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. In Proceedings of the 43rd Symposium on Foundations of Computer Science, pages 23-32, 2002. Google Scholar
  24. Subhash Khot and Rishi Saket. Hardness of coloring 2-colorable 12-uniform hypergraphs with ith 2^(log n)^Ω(1) colors. In 55th IEEE Annual Symposium on Foundations of Computer Science, pages 206-215, 2014. Google Scholar
  25. Colin McDiarmid. A random recolouring method for graphs and hypergraphs. Combinatorics, Probability and Computing, 2:363-365, 9 1993. URL:
  26. Saul Stahl. The multichromatic numbers of some kneser graphs. Discrete Mathematics, 185:287-291, 1998. Google Scholar
  27. Girish Varma. A note on reducing uniformity in Khot-Saket hypergraph coloring hardness reductions. unpublished, 2014. URL: