Terminal-Pairability in Complete Bipartite Graphs
Combinatorics
2020-04-22 v2
Abstract
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 which still guarantees that the demand graph is terminal-pairable in this setting. We also prove a sharp theorem on the maximum number of edges such a demand graph can have.
Keywords
Cite
@article{arxiv.1702.04313,
title = {Terminal-Pairability in Complete Bipartite Graphs},
author = {Lucas Colucci and Péter L. Erdős and Ervin Győri and Tamás Róbert Mezei},
journal= {arXiv preprint arXiv:1702.04313},
year = {2020}
}
Comments
8 pages, several typos corrected