arXiv subjects

Ervin Györi

Publications and source records attributed to Ervin Györi.

2 recordsLinked to original sources

arXiv2016

Terminal-Pairability in Complete Graphs

We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph $K_n$ on $n$ vertices is terminal-pairable if the maximum degree $Δ$ of the corresponding demand graph $D$ is at most $2\lfloor\frac{n}{6}\rfloor-2$. We also verify the terminal-pairability property when the number of edges in $D$ does not exceed $2n-5$ and $Δ\leq n-1$ holds.

math.CO↗

arXiv2016

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árfás, and Lehel.

math.CO↗