Original citation:Böttcher, Julia, Montgomery, Richard, Parczyk, Olaf, Person, Yury.(2017) This document is the author's final accepted version of the journal article. There may be differences between this version and the published version. You are advised to consult the publisher's version if you wish to cite from it.Embedding spanning bounded degree subgraphs in randomly perturbed graphs
AbstractWe study the model of randomly perturbed dense graphs, which is the union of any graph G α with minimum degree αn and the binomial random graph G(n, p). For p = ω(n −2/(∆+1) ), we show that G α ∪ G(n, p) contains any single spanning graph with maximum degree ∆. As in previous results concerning this model, the bound for p we use is lower by a log-term in comparison to the bound known to be needed to find the same subgraph in G(n, p) alone.