Minimum degree of bipartite graphs and the existence of k-factors (Q757438)
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 bipartite graphs and the existence of k-factors |
scientific article; zbMATH DE number 4191726
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum degree of bipartite graphs and the existence of k-factors |
scientific article; zbMATH DE number 4191726 |
Statements
Minimum degree of bipartite graphs and the existence of k-factors (English)
0 references
1990
0 references
The following result is proved: Let G be a graph and k a positive integer such that (i) \(k| V(G)|\) is even, (ii) \(\delta\) (G)\(\geq [| V(G)|]\), and (iii) \(| V(G)| \geq 4k-5\). Then G has a k-factor.
0 references
k-factor
0 references
0.96034503
0 references
0 references
0.91163105
0 references
0.9111845
0 references
0.91015744
0 references
