A density Corr\'adi-Hajnal Theorem
Combinatorics
2017-07-31 v2
Abstract
We find, for all sufficiently large and each , the maximum number of edges in an -vertex graph which does not contain vertex-disjoint triangles. This extends a result of Moon [Canad. J. Math. 20 (1968), 96-102] which is in turn an extension of Mantel's Theorem. Our result can also be viewed as a density version of the Corradi-Hajnal Theorem.
Keywords
Cite
@article{arxiv.1403.3837,
title = {A density Corr\'adi-Hajnal Theorem},
author = {Peter Allen and Julia Böttcher and Jan Hladký and Diana Piguet},
journal= {arXiv preprint arXiv:1403.3837},
year = {2017}
}
Comments
41 pages (including 11 pages of appendix), 4 figures, 2 tables