On the 1-switch conjecture. - Daniel Soltész (Discret. Math., 2017)

Independent Sets in the Union of Two Hamiltonian Cycles. - Ron Aharoni; Daniel Soltész (Electron. J. Comb., 2018)

Properties of minimally t-tough graphs. - Gyula Y. Katona; Daniel Soltész; Kitti Varga (Discret. Math., 2018)

New bounds on Simonyi's conjecture. - Daniel Soltész (Eur. J. Comb., 2018)

Triangle-different Hamiltonian paths. - István Kovács; Daniel Soltész (J. Comb. Theory B, 2018)

The mixing time of the swap (switch) Markov chains: a unified approach. - Péter L. Erdös; Catherine S. Greenhill; Tamás Róbert Mezei; István Miklós; Daniel Soltész; Lajos Soukup (CoRR, 2019)

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; István Miklós; Daniel Soltész (CoRR, 2019)

On k-Neighbor Separated Permutations. - István Kovács; Daniel Soltész (SIAM J. Discret. Math., 2019)

New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs. - Gergely Harcos; Daniel Soltész (Comb., 2020)

Even cycle creating paths. - Daniel Soltész (J. Graph Theory, 2020)

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; István Miklós; Daniel Soltész (Electron. J. Comb., 2021)

The mixing time of switch Markov chains: A unified approach. - Péter L. Erdös; Catherine S. Greenhill; Tamás Róbert Mezei; István Miklós; Daniel Soltész; Lajos Soukup (Eur. J. Comb., 2022)