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

Fingerprint

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

Keyphrases

Mathematics