Torsten Mütze

activity

20092026

most citedProof of the middle levels conjecture

60 citations · 165 across the 31 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

3 papers · 2 filters

math.CO2017

Rainbow cycles in flip graphs

Stefan Felsner, Linda Kleist, Torsten Mütze +1

The flip graph of triangulations has as vertices all triangulations of a convex $n$ -gon, and an edge between any two triangulations that differ in exactly one edge. An $r$ -rainbow…

math.CO2017★ 10 cited

Sparse Kneser graphs are Hamiltonian

Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Kneser graph $K (n, k)$ is the graph whose vertices are the $k$ -element subsets of ${1, \dots, n}$ and whose edges connect pairs of subs…

math.CO2017

A short proof of the middle levels theorem

Petr Gregor, Torsten Mütze, Jerri Nummenpalo

Consider the graph that has as vertices all bitstrings of length $2 n + 1$ with exactly $n$ or $n + 1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly…