Maximum induced forests in random graphs

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2021-12, Vol.305, p.211-213
Hauptverfasser: Krivoshapko, M., Zhukovskii, M.
Format: Artikel
Sprache:eng
Schlagworte:
Concentration
Graphs
Induced forest
Random graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated in two consecutive values.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2021.08.018