Follow
Dániel Soltész
Dániel Soltész
MTA Rényi Institute
Verified email at renyi.hu
Title
Cited by
Cited by
Year
The mixing time of switch Markov chains: a unified approach
PL Erdős, C Greenhill, TR Mezei, I Miklós, D Soltész, L Soukup
European Journal of Combinatorics 99, 103421, 2022
24*2022
Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
PL Erdős, TR Mezei, I Miklós, D Soltész
Plos one 13 (8), e0201995, 2018
132018
Questions on the structure of perfect matchings inspired by quantum physics
M Krenn, X Gu, D Soltész
arXiv preprint arXiv:1902.06023, 2019
82019
Properties of minimally t-tough graphs
GY Katona, D Soltész, K Varga
Discrete Mathematics 341 (1), 221-231, 2018
82018
Degree-preserving network growth
SR Kharel, TR Mezei, S Chung, PL Erdős, Z Toroczkai
Nature Physics 18 (1), 100-106, 2022
62022
Triangle-different Hamiltonian paths
I Kovács, D Soltész
Journal of Combinatorial Theory, Series B 129, 1-17, 2018
62018
On -Neighbor Separated Permutations
I Kovács, D Soltész
SIAM Journal on Discrete Mathematics 33 (3), 1691-1711, 2019
32019
Half-graphs, other non-stable degree sequences, and the switch Markov chain
PL Erdős, E Győri, TR Mezei, I Miklós, D Soltész
arXiv preprint arXiv:1909.02308, 2019
22019
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing
PL Erdos, E Gyori, TR Mezei, I Miklós, D Soltész
arXiv preprint arXiv:1909.02308, 2019
22019
Mixing time of the swap Markov chain and P-stability
PL Erdős, CS Greenhill, TR Mezei, I Miklós, D Soltész, L Soukup
Acta Mathematica Universitatis Comenianae 88 (3), 659-665, 2019
22019
New bounds on Simonyi’s conjecture
D Soltész
European Journal of Combinatorics 70, 251-267, 2018
22018
Even cycle creating paths
D Soltész
Journal of Graph Theory 93 (3), 350-362, 2020
12020
On the 1-switch conjecture
D Soltész
Discrete Mathematics 340 (7), 1749-1756, 2017
12017
Independent sets in the union of two Hamiltonian cycles
R Aharoni, D Soltész
arXiv preprint arXiv:1609.09746, 2016
12016
New bounds on even cycle creating Hamiltonian paths using expander graphs
G Harcos, D Soltész
Combinatorica 40 (3), 435-454, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–15