Large sets of Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs

作者：Zhao, Hongtao^*

来源：Journal of Combinatorial Designs, 2018, 26(12): 581-594.

DOI：10.1002/jcd.21629

• complete bipartite 3-uniform hypergraph
• Hamilton cycle
• Hamilton cycle decomposition
• large set

Using the Katona-Kierstead (K-K) definition of a Hamilton cycle in a uniform hypergraph, we investigate the existence of large sets of wrapped K-K Hamilton cycle decompositions of the complete bipartite 3-uniform hypergraph K-n,n((3)), settling the existence whenever n is odd. We also prove that there exists a large set of double wrapped K-K Hamilton cycle decompositions of K-n,K-n ((3)) if and only if n is even.

• 出版日期2018-11
• 单位华北电力大学