Note on Terminal-Pairability in Complete Grid Graphs
arXiv:1606.06826 · doi:10.1016/j.disc.2017.01.014
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árfás, and Lehel.
5 pages