\(K_{1,k}\)-factorization of bipartite graphs (Q1377191)

Let \(\lambda K_{m,n}\) denote the bipartite graph which is the disjoint union of \(\lambda\) graphs, each of which is isomorphic to \(K_{m,n}\). A \(K_{1,k}\)-factor of a graph \(G\) is a spanning subgraph of \(G\) composed of vertex disjoint copies of \(K_{1,k}\). A \(K_{1,k}\)-factorization of a graph \(G\) is a decomposition of the edges of \(G\) into \(K_{1,k}\)-factors. The author gives a necessary condition for \(\lambda K_{m,n}\) to admit a \(K_{1,k}\)-factorization. Furthermore, the author gives a sufficient condition for \(k K_{m,n}\) to have a \(K_{1,k}\)-factorization whenever \(k\) is a prime number.