Finding Planted Cycles in a Random Graph

Julia Gaudio, Colin Sandon, Jiaming Xu +1

In this paper, we study the problem of finding a collection of planted cycles in an \ER random graph $G\sim \mathcal{G}(n,\hat{I}»/n)$, in analogy to the famous Planted Clique Problem.…