Terminal-Pairability in $K_{n,n}$ revisited

We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on the same vertex set. We improve the lower bound on the maximum value of $\Delta(D)$ which still guarantees that the demand graph $D$ is terminal-pairable in this setting. We also prove a sharp result on the maximum number of edges such a demand graph can have.