| A widely studied problem in Combinatorics is the graph decomposition problem. The goal of problems of this type is to decompose a graph G into edge-disjoint copies of a subgraph H. In this paper, we find the necessary conditions, which are sufficient, for decomposing the complete bipartite graph $Ksb{a,b}$ into paths of length k. The decomposition requires several techniques which depend on the parity of a, b, and k. |
