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

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 , n ( 3 )if and only if n is even.