Cookies?
Library Header Image
LSE Research Online LSE Library Services

Universality for bounded degree spanning trees in randomly perturbed graphs

Böttcher, Julia, Han, Jie, Kohayakawa, Yoshiharu, Montgomery, Richard, Parczyk, Olaf and Person, Yury (2019) Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures and Algorithms. ISSN 1042-9832 (In Press)

[img] Text (Universality for bounded degree spanning trees in randomly perturbed graphs) - Accepted Version
Pending embargo until 1 January 2100.

Download (409kB) | Request a copy

Abstract

We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] 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 to it the binomial random graph G(n,C/n), then with high probability the graph Gα∪G(n,C/n) contains copies of all spanning trees with maximum degree at most Δ simultaneously, where C depends only on α and Δ.

Item Type: Article
Additional Information: © 2019 Wiley Periodicals, Inc.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 07 Feb 2019 10:36
Last Modified: 22 Mar 2019 00:11
URI: http://eprints.lse.ac.uk/id/eprint/100041

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics