Vertex-disjoint claws in graphs (Q1292832)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Vertex-disjoint claws in graphs |
scientific article; zbMATH DE number 1322015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex-disjoint claws in graphs |
scientific article; zbMATH DE number 1322015 |
Statements
Vertex-disjoint claws in graphs (English)
0 references
10 April 2000
0 references
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.
0 references
factor
0 references
claws
0 references
minimum degree
0 references
0.8828190565109253
0 references
0.8630695343017578
0 references
