35 citations · 146 across the 49 of their papers we have counts for
6 papers · 1 filter
Counting and packing Hamilton cycles in dense graphs and oriented graphs
Asaf Ferber, Michael Krivelevich, Benny Sudakov
We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several ex…
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…
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 . We prove that for every and large enough , there exists a constant fo…
Avoider-Enforcer games played on edge disjoint hypergraphs
Asaf Ferber, Michael Krivelevich, Alon Naor
We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing an analog of the classic and well known game , due to Chvátal and Erdős. We consider both stri…
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…
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…