Minimum degree of a graph and the existence of k-factors (Q1071789)
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: Minimum degree of a graph and the existence of k-factors |
scientific article; zbMATH DE number 3939396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum degree of a graph and the existence of k-factors |
scientific article; zbMATH DE number 3939396 |
Statements
Minimum degree of a graph and the existence of k-factors (English)
0 references
1985
0 references
V(G) and d(G) denote the vertex set and the minimum degree of the graph G, respectively. The main theorem of the present paper is as follows. Let k be a positive integer such that \(k| V(G)|\) is even, d(G)\(\geq [| V(G)|]/2\), and \(| V(G)| \geq 4k-5\). Then G has a k- factor.
0 references
minimum degree
0 references
k-factor
0 references
