Let $k\ge 3$ and $n$ be sufficiently large. Is it true that if $G$ is a graph with $n$ vertices and $2n-2$ edges such that every proper induced subgraph has minimum degree $\le 2$ then $G$ must contain a copy of $C_k$?