Torsten Mütze

collaborators

2 papers

cs.DS2026

Faster and simpler traversal of 0/1-polytopes

JiÅÃ Fink, Petr HladÃk, Arturo Merino +2

Recently, Merino and MÃ¼tze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope $conv (X)$ , where $X\subseteq\{0,1\}^n…

math.CO2025

Kneser graphs are Hamiltonian

Arturo Merino, Torsten MÃ¼tze, Namrata

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Kneser graph $K (n, k)$ has as vertices all $k$ -element subsets of an $n$ -element ground set, and an edge between any two disjoint sets.…