Daniel Soltész

activity

20152019

most citedThe mixing time of the switch Markov chains: a unified approach

19 citations · 50 across the 4 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Triangle-different Hamiltonian paths

István Kovács, Dániel Soltész

Let $G$ be a fixed graph. Two paths of length $n - 1$ on $n$ vertices (Hamiltonian paths) are $G$ -different if there is a subgraph isomorphic to $G$ in their union. In this paper we…

math.CO2016★ 16 cited

Properties of minimally $t$ -tough graphs

Gyula Y. Katona, Dániel Soltész, Kitti Varga

A graph $G$ is minimally $t$ -tough if the toughness of $G$ is $t$ and the deletion of any edge from $G$ decreases the toughness. Kriesell conjectured that for every minimally $1$ -t…

Triangle-different Hamiltonian paths

Properties of minimally t-tough graphs

Properties of minimally $t$ -tough graphs