Maximum induced forests in random graphs
Maria Krivoshapko, Maksim Zhukovskii
TL;DR
This paper proves that in dense binomial random graphs, the maximum size of induced forests is highly concentrated around two specific values with high probability.
Contribution
It establishes a probabilistic concentration result for the maximum induced forest size in dense random graphs, a new insight in graph theory.
Findings
Maximum induced forest sizes are concentrated in two consecutive values.
High probability concentration in dense binomial random graphs.
Provides probabilistic bounds for induced forests.
Abstract
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.