19 citations · 50 across the 4 of their papers we have counts for
7 papers
The mixing time of the switch Markov chains: a unified approach
Péter L. Erdős, Catherine Greenhill, Tamás Róbert Mezei +3
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results w…
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…
On k-neighbor separated permutations
István Kovács, Daniel Soltész
Two permutations of are \textit{-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exa…
Triangle-different Hamiltonian paths
István Kovács, Dániel Soltész
Let be a fixed graph. Two paths of length on vertices (Hamiltonian paths) are -different if there is a subgraph isomorphic to in their union. In this paper we…
Properties of minimally -tough graphs
Gyula Y. Katona, Dániel Soltész, Kitti Varga
A graph is minimally -tough if the toughness of is and the deletion of any edge from decreases the toughness. Kriesell conjectured that for every minimally -t…
New bounds on Simonyi's conjecture
Daniel Soltész
We say that a pair is a recovering pair if and are set systems on an element ground set, such that for every $A,A' \in \…
On the 1-switch conjecture in the Hypercube and other graphs
Daniel Soltész
Feder and Subi conjectured that for any -coloring of the edges of the -dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at m…