Note on Terminal-Pairability in Complete Grid Graphs
  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. 
Ervin Gy\"ori, Tam\'as R\'obert Mezei, G\'abor M\'esz\'aros
math.CO