Saturation number of tKl,l,l in the complete tripartite graph

For fixed graphs F and H, a graph G subset of F is H-saturated if there is no copy of H in G, but for any edge e is an element of E(F) \ E(G), there is a copy of H in G + e. The saturation number of H in F, denoted sat(F, H), is the minimum number of edges in an H-saturated subgraph of F. In this paper, we study saturation numbers of tK(l,l,l) in complete tripartite graph K-n1,K-n2,K-n3. For t >= 1, l >= 1 and n(1), n(2) and n(3) sufficiently large, we determine sat(K-n1,K-n2,K-n3, tK(l,l,l)) exactly.