Cookies?
Library Header Image
LSE Research Online LSE Library Services

Cycle factors in randomly perturbed graphs

Böttcher, Julia ORCID: 0000-0002-4104-3635, Parczyk, Olaf, Sgueglia, Amedeo and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2022) Cycle factors in randomly perturbed graphs. Procedia Computer Science, 195. 404 - 411. ISSN 1877-0509

[img] Text (1-s2.0-S1877050921021888-main) - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (382kB)

Identification Number: 10.1016/j.procs.2021.11.049

Abstract

We study the problem of finding pairwise vertex-disjoint copies of the ω>-vertex cycle Cω>in the randomly perturbed graph model, which is the union of a deterministic n-vertex graph G and the binomial random graph G(n, p). For ω>≥ 3 we prove that asymptotically almost surely G U G(n, p) contains min{δ(G), min{δ(G), [n/l]} pairwise vertex-disjoint cycles Cω>, provided p ≥ C log n/n for C sufficiently large. Moreover, when δ(G) ≥ αn with 0 ≤ α/l and G and is not 'close' to the complete bipartite graph Kαn(1 - α)n, then p ≥ C/n suffices to get the same conclusion. This provides a stability version of our result. In particular, we conclude that p ≥ C/n suffices when α > n/l for finding [n/l] cycles Cω>. Our results are asymptotically optimal. They can be seen as an interpolation between the Johansson-Kahn-Vu Theorem for Cω>-factors and the resolution of the El-Zahar Conjecture for Cω>-factors by Abbasi.

Item Type: Article
Official URL: https://www.sciencedirect.com/journal/procedia-com...
Additional Information: Funding Information: Supported by the Deutsche Forschungsgemeinschaft (DFG, Grant PA 3513/1-1). © 2021 Elsevier B.V.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 16 Feb 2022 15:45
Last Modified: 04 Apr 2022 08:45
URI: http://eprints.lse.ac.uk/id/eprint/113760

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics