Hardness of Finding Independent Sets in Almost 3-Colorable Graphs

Authors:
Irit Dinur;Subhash Khot;Will Perkins;Muli Safra
Affiliations:
-;-;-;-
Venue:
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Year:
2010

Citing 0
Cited 1

Approximation resistance from pairwise independent subgroups

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For every \epsilon 0, and integer q = 3, we show that given an N-vertex graph that has an induced q-colorable sub graph of size (1-\epsilon)N, it is NP-hard to find an independent set of size N/q^2.