1 citations · 1 across the 3 of their papers we have counts for
2 papers
math.CO2014
Keeping Avoider's graph almost acyclic
Dennis Clemens, Julia Ehrenmüller, Yury Person +1
We consider biased Avoider-Enforcer games in the monotone and strict versions. In particular, we show that Avoider can keep his graph being a forest for every but maybe the…
math.CO2012★ 1 cited
Fast strategies in Maker-Breaker games played on random boards
Dennis Clemens, Asaf Ferber, Michael Krivelevich +1
In this paper we analyze classical Maker-Breaker games played on the edge set of a sparse random board $G\sim \gnp$. We consider the Hamiltonicity game, the perfect matching game a…