Asaf Ferber

activity

20102013

most citedBiased Games On Random Boards

2 citations · 2 across the 4 of their papers we have counts for

collaborators

5 papers

math.CO2013

Building spanning trees quickly in Maker-Breaker games

Dennis Clemens, Asaf Ferber, Roman Glebov +2

For a tree T on n vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on n vertices, which Maker wins as soon as the graph she builds contains a…

math.CO2013

A construction of almost Steiner systems

Asaf Ferber, Rani Hod, Michael Krivelevich +1

Let $n$ , $k$ , and $t$ be integers satisfying $n > k > t \geq 2$ . A Steiner system with parameters $t$ , $k$ , and $n$ is a $k$ -uniform hypergraph on $n$ vertices in which every set of $t$ d…

math.CO2012★ 2 cited

Biased Games On Random Boards

Asaf Ferber, Roman Glebov, Michael Krivelevich +1

In this paper we analyze biased Maker-Breaker games and Avoider-Enforcer games, both played on the edge set of a random board $G\sim \gnp$. In Maker-Breaker games there are two pla…

math.CO2012

The biased odd cycle game

Asaf Ferber, Roman Glebov, Michael Krivelevich +4

In this paper we consider biased Maker-Breaker games played on the edge set of a given graph $G$ . We prove that for every $δ > 0$ and large enough $n$ , there exists a constant $k$ fo…

math.CO2010

Fast embedding of spanning trees in biased Maker-Breaker games

Asaf Ferber, Dan Hefetz, Michael Krivelevich

Given a tree $T = (V, E)$ on $n$ vertices, we consider the $(1 : q)$ Maker-Breaker tree embedding game $T_{n}$ . The board of this game is the edge set of the complete graph o…