Maximum induced forests in random graphs
Combinatorics
2021-01-21 v1
Abstract
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.
Cite
@article{arxiv.2101.08190,
title = {Maximum induced forests in random graphs},
author = {Maria Krivoshapko and Maksim Zhukovskii},
journal= {arXiv preprint arXiv:2101.08190},
year = {2021}
}