The Community for Technology Leaders
2010 IEEE 51st Annual Symposium on Foundations of Computer Science (2010)
Las Vegas, Nevada USA
Oct. 23, 2010 to Oct. 26, 2010
ISSN: 0272-5428
ISBN: 978-0-7695-4244-7
pp: 212-221
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.
INDEX TERMS
graph coloring, hardness of approximation, PCPs
CITATION

I. Dinur, S. Khot, M. Safra and W. Perkins, "Hardness of Finding Independent Sets in Almost 3-Colorable Graphs," 2010 IEEE 51st Annual Symposium on Foundations of Computer Science(FOCS), Las Vegas, Nevada USA, 2010, pp. 212-221.
doi:10.1109/FOCS.2010.84
95 ms
(Ver 3.3 (11022016))