19 citations · 88 across the 21 of their papers we have counts for
5 papers · 1 filter
Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences
Péter L. Erdős, Tamás Róbert Mezei, István Miklós
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. Several results were proved on rapidly mixing Markov ch…
Extremal solutions to some art gallery and terminal-pairability problems
Tamás Róbert Mezei
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficac…
Mobile vs. point guards
Ervin Győri, Tamás Róbert Mezei
We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using "rectangular vision". We prove a sharp bou…
Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on t…
Terminal-Pairability in Complete Bipartite Graphs
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. W…