Now showing items 1-1 of 1
A Refinement of the Triangle Version of the Corradi-Hajnal Theorem
(Georgia Institute of Technology, 2012-05)
An important part of the Corradi-Hajnal Theorem says that if n = 3k, then every n-vertex graph G with minimum degree at least 2k=2n/3 contains k vertex-disjoint triangles. The restriction on the minimum degree is sharp. ...