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 3-

uniform hypergraphs with partite sets of equal size Km,m,m (3) is decom

posable into (tight) Hamiltonian cycles if and only if 3 | m.