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 2015Show all

2 papers · 1 filter

math.CO2015

New bounds on Simonyi's conjecture

Daniel Soltész

We say that a pair $(A, B)$ is a recovering pair if $A$ and $B$ are set systems on an $n$ element ground set, such that for every $A,A' \in \…

math.CO2015

On the 1-switch conjecture in the Hypercube and other graphs

Daniel Soltész

Feder and Subi conjectured that for any $2$ -coloring of the edges of the $n$ -dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at m…