Irit Dinur, Subhash Khot, Will Perkins, Muli Safra. Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 212-221, IEEE Computer Society, 2010. [doi]
Abstract is missing.