Vertex-disjoint claws in graphs (Q1292832): Difference between revisions

Let \(\delta(G)\) denote the minimum degree of a graph \(G\). The authors prove that a graph \(G\) of order at least \(4k+6\) with \(\delta(G)\geq k+2\) contains \(k\) pairwise vertex-disjoint \(K_{1,3}\)'s. The conditions on the minimum degree and on the order of the graph are best possible in a sense.