HAMILTON DECOMPOSITION OF COMPLETE BIPARTITE 3-UNIFORM HYPERGRAPHS

Authors

Jirimutu Jirimutu, College of Mathematics and Computer Science, Inner Mongolia for National University Tongliao 028043, P.R. ChinaFollow
Jul Wang, Department of Applied Mathematic, Dalian University of Technology, Dalian 116024, P.R. China.

Abstract

The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph 3 Kn has been solved for n ≡ 2(mod 3), n ≡ 4(mod 6) [2], n ≡ 1(mod 6), n ≡ 0(mod 3) (for 3 , K I n − the 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 3 Km,m for m be prime.

Recommended Citation

Jirimutu, Jirimutu and Wang, Jul (2010) "HAMILTON DECOMPOSITION OF COMPLETE BIPARTITE 3-UNIFORM HYPERGRAPHS," Journal of Marine Science and Technology: Vol. 18: Iss. 5, Article 17.
DOI: 10.51400/2709-6998.1931
Available at: https://jmstt.ntou.edu.tw/journal/vol18/iss5/17