Maximum chordal subgraphs of random graphs

We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph $G(n,p)$, for $p=\mathrm{c}\mathrm{o}\mathrm{n}\mathrm{s}\mathrm{t}$ and $p=n^{-\alpha +o(1)}$.