Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6579076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decompositions of complete graphs into bipartite 2-regular subgraphs |
scientific article; zbMATH DE number 6579076 |
Statements
Decompositions of complete graphs into bipartite 2-regular subgraphs (English)
0 references
11 May 2016
0 references
Summary: It is shown that if \(G\) is any bipartite 2-regular graph of order at most \(n/2\) or at least \(n-2\), then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order \(n\) into a perfect matching and edge-disjoint copies of \(G\).
0 references
graph decompositions
0 references
0 references
0.8793312907218933
0 references
0.8719645738601685
0 references
0.8622307777404785
0 references
0.845821738243103
0 references
