Torsten Mütze

activity

20242026

collaborators

Showing 2024Show all

2 papers · 1 filter

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

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…