No CrossRef data available.
Article contents
Maximum chordal subgraphs of random graphs
Published online by Cambridge University Press: 03 May 2024
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)}$.
- Type
- Paper
- Information
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press
Footnotes
Michael Krivelevich: Research supported in part by USA-Israel BSF grant 2018267.