Maximum chordal subgraphs of random graphs

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)}$.

References in corpus (2)

• Extremal Cuts of Sparse Random Graphs
• Extremal results for random discrete structures