Published in

Elsevier, Discrete Applied Mathematics, (236), p. 459-463, 2018

DOI: 10.1016/j.dam.2017.10.026

Links

Tools

Export citation

Search in Google Scholar

Terminal-Pairability in Complete Bipartite Graphs

Journal article published in 2017 by Lucas Colucci, Péter L. Erdős ORCID, Ervin Győri, Tamás Róbert Mezei ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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 $Δ(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. ; Comment: 8 pages