60 citations · 165 across the 31 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
A book proof of the middle levels theorem
Torsten Mütze
We give a short constructive proof for the existence of a Hamilton cycle in the subgraph of the -dimensional hypercube induced by all vertices with exactly or man…
cs.DM2023
Combinatorial generation via permutation languages. VI. Binary trees
Petr Gregor, Torsten Mütze, Namrata
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree pattern…
cs.DM2023
Traversing combinatorial 0/1-polytopes via optimization
Arturo Merino, Torsten Mütze
In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, po…