科研之友
微信
新浪微博
Facebook
分享链接
摘要
The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph K(n)(3) has been solved for n equivalent to 2(mod 3), n equivalent to 4(mod 6) [2], n equivalent to 1(mod 6), n equivalent to 0(mod 3) (for K(n)(3) - I, complete 3-uniform hypergraph minus a 1-factor) [5]. In this paper, we give the concept of the bipartite hypergraphs and find a Hamilton decomposition of the complete bipartite hypergraph K(m,m)(3) for m be prime.
