Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs

We study two closely related questions. The first addresses when we can decompose the edge set into edge disjoint paths of increasing order where the order grows exactly by one in each step. The second asks for conditions under which a complete bipartite graph decomposes into ascending subgraphs of paths.