3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 3 cited
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…
math.CO2011
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…
math.CO2009
Probabilistic one-player Ramsey games via deterministic two-player games
Michael Belfrage, Torsten Mütze, Reto Spöhel
Consider the following probabilistic one-player game: The board is a graph with vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at rand…