Abstract
We 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
