Maximum induced forests in random graphs
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.
math.CO↗
arXiv subjects
Publications and source records attributed to Maria Krivoshapko.
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.