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

Other

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

Fingerprint

Hardness

Keywords

  • Graph coloring
  • Hardness of approximation
  • PCPs

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Dinur, I., Khot, S., Perkins, W., & Safra, M. (2010). Hardness of finding independent sets in almost 3-colorable graphs. In Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 (pp. 212-221). [5670828] https://doi.org/10.1109/FOCS.2010.84

Hardness of finding independent sets in almost 3-colorable graphs. / Dinur, Irit; Khot, Subhash; Perkins, Will; Safra, Muli.

Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. 2010. p. 212-221 5670828.

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

Dinur, I, Khot, S, Perkins, W & Safra, M 2010, Hardness of finding independent sets in almost 3-colorable graphs. in Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010., 5670828, pp. 212-221, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, NV, United States, 10/23/10. https://doi.org/10.1109/FOCS.2010.84
Dinur I, Khot S, Perkins W, Safra M. Hardness of finding independent sets in almost 3-colorable graphs. In Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. 2010. p. 212-221. 5670828 https://doi.org/10.1109/FOCS.2010.84
Dinur, Irit ; Khot, Subhash ; Perkins, Will ; Safra, Muli. / Hardness of finding independent sets in almost 3-colorable graphs. Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. 2010. pp. 212-221
@inproceedings{b526028a02b8487ba38ceb6be8e8c293,
title = "Hardness of finding independent sets in almost 3-colorable graphs",
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.",
keywords = "Graph coloring, Hardness of approximation, PCPs",
author = "Irit Dinur and Subhash Khot and Will Perkins and Muli Safra",
year = "2010",
doi = "10.1109/FOCS.2010.84",
language = "English (US)",
isbn = "9780769542447",
pages = "212--221",
booktitle = "Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010",

}

TY - GEN

T1 - Hardness of finding independent sets in almost 3-colorable graphs

AU - Dinur, Irit

AU - Khot, Subhash

AU - Perkins, Will

AU - Safra, Muli

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Graph coloring

KW - Hardness of approximation

KW - PCPs

UR - http://www.scopus.com/inward/record.url?scp=78751499886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78751499886&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2010.84

DO - 10.1109/FOCS.2010.84

M3 - Conference contribution

AN - SCOPUS:78751499886

SN - 9780769542447

SP - 212

EP - 221

BT - Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010

ER -