Large sets of Hamilton cycle decompositions of complete bipartite graphs (Q932831): Difference between revisions

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.