Abstract
We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than \(2^{\Omega(K^{1/3})}\) colors. This improves the previous result of K versus \(K^{\frac{1}{25}\log K}\) in Khot [1].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: FOCS, pp. 600–609 (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)
Wigderson, A.: A new approximate graph coloring algorithm. In: STOC, pp. 325–329 (1982)
Berger, B., Rompel, J.: A better performance guarantee for approximate graph coloring. Algorithmica 5(3), 459–466 (1990)
Karger, D.R., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM 45(2), 246–265 (1998)
Blum, A., Karger, D.R.: An \({\tilde{O}}(n^{3/14})\)-coloring algorithm for 3-colorable graphs. Inf. Process. Lett. 61(1), 49–53 (1997)
Kawarabayashi, K., Thorup, M.: Combinatorial coloring of 3-colorable graphs. In: FOCS, pp. 68–75 (2012)
Arora, S., Chlamtac, E.: New approximation guarantee for chromatic number. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 215–224. ACM, New York (2006)
Chlamtac, E.: Approximation algorithms using hierarchies of semidefinite programming relaxations. In: FOCS, pp. 691–701 (2007)
Khanna, S., Linial, N., Safra, S.: On the hardness of approximating the chromatic number. Combinatorica 20(3), 393–415 (2000)
Guruswami, V., Khanna, S.: On the hardness of 4-coloring a 3-colorable graph. SIAM J. Discrete Math. 18(1), 30–40 (2004)
Dinur, I., Mossel, E., Regev, O.: Conditional hardness for approximate coloring. SIAM J. Comput. 39(3), 843–873 (2009)
Dinur, I., Shinkar, I.: On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol. 6302, pp. 138–151. Springer, Heidelberg (2010)
Guruswami, V., Sinop, A.K.: The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. In: SODA, pp. 1615–1626 (2011)
Håstad, J., Khot, S.: Query efficient PCPs with perfect completeness. Theory of Computing 1(1), 119–148 (2005)
Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: STOC, pp. 191–199 (2000)
Chan, S.O.: Approximation resistance from pairwise independent subgroups. In: STOC, pp. 447–456 (2013)
Chan, S.O.: Approximation resistance from pairwise independent subgroups. Electronic Colloquium on Computational Complexity (ECCC)Â 19, 110 (2012)
Samorodnitsky, A., Trevisan, L.: Gowers uniformity, influence of variables, and PCPs. SIAM J. Comput. 39(1), 323–360 (2009)
Hast, G.: Beating a random assignment. PhD Thesis (2005)
Dinur, I., Khot, S., Perkins, W., Safra, M.: Hardness of finding independent sets in almost 3-colorable graphs. In: FOCS, pp. 212–221 (2010)
Khot, S., Saket, R.: Hardness of finding independent sets in almost q-colorable graphs. In: FOCS, pp. 380–389 (2012)
Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: STOC, pp. 453–461 (2001)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. J. ACM 45(1), 70–122 (1998)
Raz, R.: A parallel repetition theorem. SIAM J. Comput. 27(3), 763–803 (1998)
Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. J. ACM 43(2), 268–292 (1996)
Clementi, A.E.F., Trevisan, L.: Improved non-approximability results for minimum vertex cover with density constraints. Theor. Comput. Sci. 225(1-2), 113–128 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, S. (2013). Improved Hardness of Approximating Chromatic Number. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2013 2013. Lecture Notes in Computer Science, vol 8096. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40328-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-40328-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40327-9
Online ISBN: 978-3-642-40328-6
eBook Packages: Computer ScienceComputer Science (R0)