5 citations · 6 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 5 cited
Weak and Strong k-connectivity games
Asaf Ferber, Dan Hefetz
For a positive integer we consider the -vertex-connectivity game, played on the edge set of , the complete graph on vertices. We first study the Maker-Breaker versi…
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…