Some gregarious kite decompositions of complete equipartite graphs

A kite decomposition of a complete multipartite graph is said to be gregarious if each kite in the decomposition has its vertices in four different partite sets. In this paper, we give certain necessary and sufficient conditions for the existence of a gregarious kite decomposition of the complete equipartite graph Kn(m) (with n≥4 parts of size m).