Vertex disjoint cycles for star free graphs.
Guantao Chen, Lisa R. Marcus, RICHARD H. SCHELP · 1995
A graph is claw-free if it does not contain K I,3 as an induced subgraph. A graph is KI,r-free if it does not contain KI,r as an induced subgraph. In this paper, we find bounds on the minimum number of edges needed to ensure a KI,.,.-free contains k vertex disjoint cycles. The bound on claw-free graphs is sharp. 1