A note on potentially K-1,K-1,K-t-graphic sequences

For a given graph H, let sigma(H,n) he the smallest even integer such that every n-term non-increasing graphic sequence pi = (d(1), d(2),... d(n)) with sigma(pi) =d(1)+ d(2)+... + d(n) >= sigma(H,n) has a realization G containing H as a suhgraph. In this paper, we determine the values of sigma(K-1,K-1,K-t,n) for t >= 3 and n >= 2[(t+5)2/4] +3, where K-r,K-s,K-t is the r x s x t complete 3-partite graph.