Large sets of Hamilton cycle decompositions of complete bipartite graphs (Q932831)
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 5300783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large sets of Hamilton cycle decompositions of complete bipartite graphs |
scientific article; zbMATH DE number 5300783 |
Statements
Large sets of Hamilton cycle decompositions of complete bipartite graphs (English)
0 references
11 July 2008
0 references
Let \(K_{p,p}\) be the complete bipartite graph with \(p\) vertices in each partite set. The authors prove that there exist a large set of Hamilton cycle decomposition of \(K_{2t,2t}\) and a large Hamilton cycle decomposition of \(K_{2t+1,2t+1}-I\), where \(I\) is a perfect matching.
0 references
Hamilton cycle decomposition
0 references
Complete bipartite graph
0 references
0.9059004187583924
0 references
0.9056738615036012
0 references
0.8517674803733826
0 references
0.8341121077537537
0 references
