Hardness of finding independent sets in almost 3-colorable graphs

Irit Dinur, Subhash Khot, Will Perkins, Muli Safra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For every ∈ > 0, and integer q ≥ 3, we show that given an N-vertex graph that has an induced q-colorable subgraph of size (1-∈)N, it is NP-hard to find an independent set of size N/q2.

Original languageEnglish (US)
Title of host publicationProceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
Pages212-221
Number of pages10
DOIs
StatePublished - 2010
Event2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 - Las Vegas, NV, United States
Duration: Oct 23 2010Oct 26 2010

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Other

Other2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010
CountryUnited States
CityLas Vegas, NV
Period10/23/1010/26/10

Keywords

  • Graph coloring
  • Hardness of approximation
  • PCPs

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Hardness of finding independent sets in almost 3-colorable graphs'. Together they form a unique fingerprint.

Cite this