Maximum induced forests in random graphs
arXiv:2101.08190
Abstract
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.
arXiv:2101.08190
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.