Note on Terminal-Pairability in Complete Grid Graphs
Combinatorics
2017-02-16 v1
Abstract
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessary maximum degree in path-pairable graphs, a question originally raised and studied by Faudree, Gy\'arf\'as, and Lehel.
Keywords
Cite
@article{arxiv.1606.06826,
title = {Note on Terminal-Pairability in Complete Grid Graphs},
author = {Ervin Györi and Tamás Róbert Mezei and Gábor Mészáros},
journal= {arXiv preprint arXiv:1606.06826},
year = {2017}
}
Comments
5 pages