Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
arXiv:1705.02124 · doi:10.1016/j.tcs.2018.12.007
Abstract
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. In computer science, this problem is known as the edge-disjoint paths problem. We improve the lower bound on the maximum value of which still guarantees that the demand graph has a realization in . We also solve the extremal problem on the number of edges, i.e., we determine the maximum number of edges which guarantees that a demand graph is realizable in .
15 pages, draws from arXiv:1702.04313