We consider a robust analog of the planted clique problem. In this analog, a set S of vertices is chosen and all edges in S are included; then, edges between S and the rest of the graph are included with probability \frac{1}{2}, while edges not touching S are allowed to ... more >>>