Maximum induced forests in random graphs

preprint2021arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.