A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (Q1078203)
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: A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components |
scientific article; zbMATH DE number 3959479
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components |
scientific article; zbMATH DE number 3959479 |
Statements
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (English)
0 references
1986
0 references
The complete bipartite graph \(k_{1,m}\), \(m\geq 1\), is called a star. In this note it is shown, for \(n\geq 4\), that the minimum number of star- subgraphs which partition the edges of \(k_{2n-1,2n-1}\) or \(k_{2n,2n}\) is \(n+2\).
0 references
edge partition
0 references
complete bipartite graph
0 references
star
0 references
partition
0 references
0.9422758
0 references
0.9347966
0 references
0.9234736
0 references
0.91774666
0 references
0 references
