Abstract
The theory of randomly perturbed graphs deals with the properties of graphs obtained as the union of a deterministic graph H and a random graph G. We study Hamiltonicity in two distinct settings. In both of them, we assume H is some deterministic graph with minimum degree at least \(\alpha n\), for some \(\alpha \) (possibly depending on n). We first consider the case when G is a random geometric graph, and obtain an asymptotically optimal result. We then consider the case when G is a random regular graph, and obtain different results depending on the regularity.
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.
