# Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring

@article{Khot2001ImprovedIR, title={Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring}, author={S. Khot}, journal={Proceedings 2001 IEEE International Conference on Cluster Computing}, year={2001}, pages={600-609} }

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 n/sup 1-/spl epsi// or arbitrarily small constant /spl epsi/>0 unless… CONTINUE READING

#### Topics from this paper.

199 Citations

Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion

- Mathematics, Computer Science
- 2006

- 78

Linear degree extractors and the inapproximability of max clique and chromatic number

- Computer Science, Mathematics
- 2006

- 699
- PDF

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

- Mathematics, Computer Science
- 2017

- 54
- PDF

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

- Mathematics, Computer Science
- 2014

- 21
- PDF

Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique

- Computer Science, Mathematics
- 2004

- 82

Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph

- Computer Science, Mathematics
- 2012

- 87
- PDF

Graphs with tiny vector chromatic numbers and huge chromatic numbers

- Computer Science, Mathematics
- 2002

- 23
- PDF

Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis

- Mathematics, Computer Science
- 2018

- 18
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 40 REFERENCES

Free bits, PCPs and non-approximability-towards tight results

- Mathematics, Computer Science
- 1995

- 331
- PDF

Randomized graph products, chromatic numbers, and the Lovász ϑ-function

- Mathematics, Computer Science
- 1997

- 72