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

5 papers · 1 filter

math.CO2024

Listing faces of polytopes

Nastaran Behrooznia, Sofia Brenner, Arturo Merino +3

This paper investigates the problem of listing faces of polytopes that represent combinatorial objects, such as hypercubes, permutahedra, associahedra, and their generalizations. F…

math.CO2024

Flips in colorful triangulations

Rohan Acharya, Torsten Mütze, Francesco Verciani

The associahedron is the graph $G_{N}$ that has as nodes all triangulations of a convex $N$ -gon, and an edge between any two triangulations that differ in a flip operation.…

math.CO2024

Graphs that admit a Hamilton path are cup-stackable

Petr Gregor, Arturo Merino, Torsten Mütze +1

Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph $G$ , which they called cup stacking. Stacks of cups are placed at the vertices of $G$ , a…

math.CO2024

Matchings in hypercubes extend to long cycles

Jiří Fink, Torsten Mütze

The $d$ -dimensional hypercube graph $Q_{d}$ has as vertices all subsets of ${1, \dots, d}$ , and an edge between any two sets that differ in a single element. The Ruskey-Savage conje…

math.CO2024★ 1 cited

Hamiltonicity of Schrijver graphs and stable Kneser graphs

Torsten Mütze, Namrata

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Schrijver graph $S (n, k)$ has as vertices all $k$ -element subsets of $[n] := {1, 2, \dots, n}$ that contain no two cyclically adjacent ele…