Maximum chordal subgraphs of random graphs
Combinatorics
2024-11-20 v3
Abstract
We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph , for and .
Cite
@article{arxiv.2308.08944,
title = {Maximum chordal subgraphs of random graphs},
author = {Michael Krivelevich and Maksim Zhukovskii},
journal= {arXiv preprint arXiv:2308.08944},
year = {2024}
}