Note on Terminal-Pairability in Complete Grid Graphs
classification
🧮 math.CO
keywords
graphscompletegridlehelquestionaffirmativelyanswerby-product
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.