Premium
Large sets of Hamilton cycle decompositions of complete bipartite 3‐uniform hypergraphs
Author(s) -
Zhao Hongtao
Publication year - 2018
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21629
Subject(s) - mathematics , hypergraph , combinatorics , bipartite graph , hamiltonian path , set (abstract data type) , discrete mathematics , graph , computer science , programming language
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.