60 citations · 165 across the 31 of their papers we have counts for
4 papers · 1 filter
Construction of 2-factors in the middle layer of the discrete cube
Torsten Mütze, Franziska Weber
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length that have exactly or entries equal to 1, with an edge between any…
On globally sparse Ramsey graphs
Torsten Mütze, Ueli Peter
We say that a graph has the Ramsey property w.r.t.\ some graph and some integer , or is -Ramsey for short, if any -coloring of the edges of conta…
Coloring random graphs online without creating monochromatic subgraphs
Torsten Mütze, Thomas Rast, Reto Spöhel
Consider the following random process: The vertices of a binomial random graph are revealed one by one, and at each step only the edges induced by the already revealed ve…
On the path-avoidance vertex-coloring game
Torsten Mütze, Reto Spöhel
For any graph and any integer , the \emph{online vertex-Ramsey density of and }, denoted , is a parameter defined via a deterministic two-player Ramse…