Jing SHI, Jian WANG, Bei-liang DU
Let be a complete bipartite multigraph with two partite sets having and vertices, respectively. A -factorization of is a set of -factors of which partition the set of edges of . When , Martin, in [Complete bipartite factorizations by complete bipartite graphs, Discrete Math., 167/168 (1997), 461-480], gave simple necessary conditions for such a factorization to exist, and conjectured those conditions are always sufficient. In this paper, we will study the -factorization of for , to show that the necessary conditions for such a factorization are always sufficient whenever related parameters are sufficiently large.