HAMILTONIAN DECOMPOSITION OF COMPLETE TRIPARTITE 3-UNIFORM HYPERGRAPHS

Abstract

With our definition for complete tripartite 3-uniform hypergraphs which contain two types of edges, we show that complete tripartite 3uniform hypergraphs with partite sets of equal size K(3)m,m,m is decomposable into (tight) Hamiltonian cycles if and only if 3 | m.