Skip to Main Content
The author presents improved inapproximability results for three problems: the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and the problem of coloring a graph with a small chromatic number with a small number of colors. J. Hastad's (1996) result shows that the maximum clique size in a graph with n vertices is inapproximable in polynomial time within a factor n1-ε or arbitrarily small constant ε>0 unless NP=ZPP. We aim at getting the best subconstant value of ε in Hastad's result. We prove that clique size is inapproximable within a factor n/2((log n))1-y corresponding to ε=1/(log n)γ for some constant γ>0 unless NP⊆ZPTIME(2((log n))O(1)). This improves the previous best inapproximability factor of n/2O(log n√log log n)/ (corresponding to ε=O(1/√log log n)) due to L. Engebretsen and J. Holmerin (2000). A similar result is obtained for the problem of approximating chromatic number of a graph. We also present a new hardness result for approximate graph coloring. We show that for all sufficiently large constants k, it is NP-hard to color a k-colorable graph with k125 (log k)/ colors. This improves a result of M. Furer (1995) that for arbitrarily small constant ε>0, for sufficiently large constants k, it is hard to color a k-colorable graph with k32-ε/ colors.