Lucas Colucci, Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei
Published 2017-02-14Version 1
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. We improve the lower bound on maximum value of $\Delta(D)$ which still guarantees that the demand graph $D$ is terminal-pairable in this setting. We also prove a sharp theorem on the maximum number of edges such a demand graph can have.
Terminal-Pairability in $K_{n,n}$ revisited
Base Graph -- Connection Graph: Dissection and Construction
A tropical morphism related to the hyperplane arrangement of the complete bipartite graph
![QR code for arXiv:1702.04313 [math.CO]](http://oss.arxitics.com/images/favicon.svg)