Vertex-disjoint triangles in claw-free graphs with minimum degree at least three (Q1297765)

A claw is a graph on four vertices with three edges that connect three of the vertices with the fourth one. It is proved that if \(G\) is a claw-free graph of order \(6(k-1)\) or higher \((k \geq 2)\) and minimum degree at least 3, then either \(G\) contains \(k\) vertex-disjoint triangles, or \(G\) belongs to a known class of graphs.