Key points are not available for this paper at this time.
Abstract We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph G (n, p), for p=const and p=n^- +o (1).
Krivelevich et al. (Fri,) studied this question.