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

4 papers · 1 filter

math.CO2022

Combinatorial generation via permutation languages. V. Acyclic orientations

Jean Cardinal, Hung P. Hoang, Arturo Merino +2

In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provi…

math.CO2022

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.…

math.CO2022

The Hamilton compression of highly symmetric graphs

Petr Gregor, Arturo Merino, Torsten Mütze

We say that a Hamilton cycle $C = (x_{1}, \dots, x_{n})$ in a graph $G$ is $k$ -symmetric, if the mapping $x_{i} \mapsto x_{i + n / k}$ for all $i = 1, \dots, n$ , where indices are considered modulo…

math.CO2022

Combinatorial Gray codes-an updated survey

Torsten Mütze

A combinatorial Gray code for a class of objects is a listing that contains each object from the class exactly once such that any two consecutive objects in the list differ only by…