In this short paper, we study the Planted Clique problem in a semi-random model. Our model is inspired from the Feige-Kilian model [FK01] which has been studied in many other works [Ste17, MMT20]. Our algorithm and analysis is on similar lines to the one studied for the Densest k-subgraph problem in the recent work of Khanna and Louis [KL20]. However since our algorithm fully recovers the planted clique w.h.p., we require some new ideas. As a by-product of our main result, we give an alternate SDP based rounding algorithm (with matching guarantees) for solving the Planted Clique problem in a random graph. Also, we are able to solve a special case of the DkSReg(n, k, d, \delta, \gamma) model introduced in [KL20], when the planted subgraph G S is a clique  .
In this paper, we study the Planted Clique problem in a semi-random model. Our model is inspired from the Feige-Kilian model [FK01] which has been studied in many other works [Ste17, MMT20]. Our algorithm and analysis is on similar lines to the one studied for the Densest k-subgraph problem in the recent work of Khanna and Louis [KL20]. However since our algorithm fully recovers the planted clique w.h.p., we require some new ideas. As a by-product of our main result, we give an alternate SDP based rounding algorithm (with matching guarantees) for solving the Planted Clique problem in a random graph. Also, we are able to solve special cases of the DkSReg(n, k, d, \delta, \gamma) and DkSReg(n, k, d, \delta, d', \lambda) models introduced in [KL20], when the planted subgraph \mathcal{G is a clique instead of an arbitrary d-regular graph .
D
short
R
a special case
special cases
R
model
and DkSReg(n, k, d, \delta, d', \lambda) models
D
G
R
S
\mathcal{G
A
instead of an arbitrary d-regular graph