Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ k + 2 contains k pairwise vertex-disjoint K1,3's. The conditions on the minimum degree and on the order of the graph are best possible in a sense.
|Number of pages||22|
|Publication status||Published - 1999 Feb 28|
- Minimum degree
- Vertex-disjoint subgraphs
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics