A robust Corrádi–Hajnal theorem

Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia ORCID: 0000-0002-4104-3635, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby and Skokan, Jozef ORCID: 0000-0003-3996-7676 (2024) A robust Corrádi–Hajnal theorem. Random Structures & Algorithms. ISSN 1042-9832

Text (Allen_a-robust-carradi-hajnal-theorem--published) - Published Version Available under License Creative Commons Attribution. Download (2MB)

• Author
• Author
• Author
• Scopus publication

Abstract

For a graph (Formula presented.) and (Formula presented.), we denote by (Formula presented.) the random sparsification of (Formula presented.) obtained by keeping each edge of (Formula presented.) independently, with probability (Formula presented.). We show that there exists a (Formula presented.) such that if (Formula presented.) and (Formula presented.) is an (Formula presented.) -vertex graph with (Formula presented.) and (Formula presented.), then with high probability (Formula presented.) contains a triangle factor. Both the minimum degree condition and the probability condition, up to the choice of (Formula presented.), are tight. Our result can be viewed as a common strengthening of the seminal theorems of Corrádi and Hajnal, which deals with the extremal minimum degree condition for containing triangle factors (corresponding to (Formula presented.) in our result), and Johansson, Kahn and Vu, which deals with the threshold for the appearance of a triangle factor in (Formula presented.) (corresponding to (Formula presented.) in our result). It also implies a lower bound on the number of triangle factors in graphs with minimum degree at least (Formula presented.) which gets close to the truth.

Item Type:	Article
Official URL:	https://onlinelibrary.wiley.com/journal/10982418
Additional Information:	© 2024 The Authors
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	19 Jan 2024 15:45
Last Modified:	27 Feb 2024 00:11
URI:	http://eprints.lse.ac.uk/id/eprint/121420

Actions (login required)

View Item