A density Corrádi-Hajnal theorem
Allen, P.
, Böttcher, J., Hladký, J. & Piguet, D.
(2015).
A density Corrádi-Hajnal theorem.
Canadian Journal of Mathematics,
67(4), 721-758.
https://doi.org/10.4153/CJM-2014-030-6
, Böttcher, J., Hladký, J. & Piguet, D.
(2015).
A density Corrádi-Hajnal theorem.
Canadian Journal of Mathematics,
67(4), 721-758.
https://doi.org/10.4153/CJM-2014-030-6
We find, for all sufficiently large n and each k, the maximum number of edges in an n-vertex graph which does not contain k+1 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 Corrádi-Hajnal Theorem.