Autor:	Colucci, Lucas, Erdős, Péter L., Győri, Ervin, Mezei, Tamás Róbert
Rok vydání:	2017
Předmět:	Mathematics - Combinatorics
Zdroj:	Discrete Applied Mathematics, Volume 236, 19 February 2018, Pages 459-463
Druh dokumentu:	Working Paper
DOI:	10.1016/j.dam.2017.10.026
Popis:	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. Comment: 8 pages, several typos corrected
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1702.04313 Zobrazit plný text záznamu View this record from Arxiv