Items where Author is "Soltész, Dániel"

Erdős, Péter and Greenhill, C. and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel and Soukup, Lajos (2022) The mixing time of switch Markov chains: A unified approach. EUROPEAN JOURNAL OF COMBINATORICS, 99. No.-103421. ISSN 0195-6698

Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2021) Half-graphs, other non-stable degree sequences, and the switch Markov chain. ELECTRONIC JOURNAL OF COMBINATORICS, 28 (3). ISSN 1097-1440

Soltész, Dániel (2020) Even cycle creating paths. JOURNAL OF GRAPH THEORY, 93 (3). pp. 350-362. ISSN 0364-9024

Harcos, Gergely and Soltész, Dániel (2020) New bounds on even cycle creating Hamiltonian paths using expander graphs. COMBINATORICA, 40. pp. 435-454. ISSN 0209-9683

Kovács, István and Soltész, Dániel (2019) On k-neighbor separated permutations. SIAM JOURNAL ON DISCRETE MATHEMATICS, 33 (3). pp. 1691-1711. ISSN 0895-4801 (print); 1095-7146 (online)

Erdős, Péter and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2018) Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs. PLOS ONE, 13 (8). ISSN 1932-6203

Aharoni, Ron and Soltész, Dániel (2018) Independent sets in the union of two Hamiltonian cycles. ELECTRONIC JOURNAL OF COMBINATORICS, 25 (4). ISSN 1097-1440

Soltész, Dániel (2018) New bounds on Simonyi’s conjecture. EUROPEAN JOURNAL OF COMBINATORICS, 70. pp. 251-267. ISSN 0195-6698

Katona, Gyula Y. and Soltész, Dániel and Varga, Kitti Katalin (2018) Properties of minimally t-tough graphs. DISCRETE MATHEMATICS, 341 (1). pp. 221-231. ISSN 0012-365X

Kovács, István and Soltész, Dániel (2018) Triangle-different Hamiltonian paths. JOURNAL OF COMBINATORIAL THEORY SERIES B, 129. pp. 1-17. ISSN 0095-8956