Triangle Factors of Graphs Without Large Independent Sets and of Weighted Graphs

摘要

The classical Corradi-Hajnal theorem claims that every n-vertex graph G with delta(G) >= 2n/3 contains a triangle factor, when 3|n. In this paper we present two related results that both use the absorbing technique of Rodl, Rucinski and Szemeredi.