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

2 papers · 1 filter

cs.DS2015

Efficient computation of middle levels Gray codes

Torsten Mütze, Jerri Nummenpalo

For any integer $n \geq 1$ a middle levels Gray code is a cyclic listing of all bitstrings of length $2 n + 1$ that have either $n$ or $n + 1$ entries equal to 1 such that any two consec…

math.CO2015★ 34 cited

Bipartite Kneser graphs are Hamiltonian

Torsten Mütze, Pascal Su

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 $[n] := {1, 2, \dots, n}$ and an edge between any two vertices (=sets) th…