Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call