Universality for bounded degree spanning trees in randomly perturbed graphs

We solve a problem of Krivelevich, Kwan and Sudakov concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs. More precisely, we show that, if we start with a dense graph Gα on n vertices with δ(Gα) ≥ αn for α > 0 and we add...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 55; číslo 4; s. 854 - 864
Hlavní autori:	Böttcher, Julia, Han, Jie, Kohayakawa, Yoshiharu, Montgomery, Richard, Parczyk, Olaf, Person, Yury
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.12.2019 Wiley Subscription Services, Inc
Predmet:	Apexes Containment Graph theory Graphs perturbed graphs random graphs spanning trees Trees (mathematics) universality
ISSN:	1042-9832, 1098-2418
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!