Kp,q-factorization of the complete bipartite graph Km,n

Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Kp,q-factorization of Km,n is a set of edge-disjoint Kp,q-factors of Km,n which partition the set of edges of Km,n. Martin (Discrete Math. 167/168 (1997) 461) gave simple necessary conditions for Kp,q-factorization of Km,n, and conjectured these conditions are sufficient. In this paper, it is shown that Martinʹs conjecture on Kp,q-factorization of Km,n is true for p:q=2:3.