完全二部图的终偶性
Terminal-Pairability in Complete Bipartite Graphs
摘要：
研究了当基图是完全二部图，而需求图也是二部图且具有相同颜色类时的终端配对问题。我们改进了$Δ(D)$的最大值的下界，这仍然保证了需求图$D$在此设置中是终端可配对的。我们还证明了一个尖锐的定理的最大数量的边缘，这样的需求图可以有。
英文摘要：
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 $Δ(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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
