We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) 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, Gyarfas, and Lehel (1999).
['Ervin Györi', 'Tamás Róbert Mezei', 'Gábor Mészáros']
Note on Terminal-Pairability in Complete Grid Graphs