Daniel Soltész

Orcid: 0000-0002-1668-748X

According to our database1, Daniel Soltész authored at least 12 papers between 2017 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The mixing time of switch Markov chains: A unified approach.
Eur. J. Comb., 2022

2021
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.
Electron. J. Comb., 2021

2020
Even cycle creating paths.
J. Graph Theory, 2020

New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs.
Comb., 2020

2019
On k-Neighbor Separated Permutations.
SIAM J. Discret. Math., 2019

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.
CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.
CoRR, 2019

2018
Triangle-different Hamiltonian paths.
J. Comb. Theory B, 2018

New bounds on Simonyi's conjecture.
Eur. J. Comb., 2018

Properties of minimally t-tough graphs.
Discret. Math., 2018

Independent Sets in the Union of Two Hamiltonian Cycles.
Electron. J. Comb., 2018

2017
On the 1-switch conjecture.
Discret. Math., 2017


  Loading...