A Density Version of the Corradi-Hajnal Theorem

Dieter Rautenbach, Bruce Reed

For every positive integer $k$, we show that every graph of order $n$ at least $3k$ with more than $$\max \{(\genfrac{}{}{0ex}{}{2k-1}{2})+(2k-1)(n-(2k-1)),(\genfrac{}{}{0ex}{}{3k-1}{2})+(n-(3k-1))\}$$ edges has…