activity
20152023
most citedThe mixing time of the switch Markov chains: a unified approach

19 citations · 88 across the 21 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 11 cited

Note on Terminal-Pairability in Complete Grid Graphs

Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros

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-prod…

math.CO2016★ 10 cited

Terminal-Pairability in Complete Graphs

Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros

We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph on vertices is termi…