3 citations · 7 across the 5 of their papers we have counts for
8 papers
Component Games on Random Graphs
Rani Hod, Michael Krivelevich, Tobias Müller +2
In the component game played on a graph , two players, Maker and Breaker, alternately claim~ and~ previously unclaimed edges of , respectively. Maker…
-games played on vertex sets of random graphs
Gal Kronenberg, Adva Mond, Alon Naor
We introduce a new type of positional games, played on a vertex set of a graph. Given a graph , two players claim vertices of , where the outcome of the game is determined by…
Ramsey-nice families of graphs
Ron Aharoni, Noga Alon, Michal Amir +5
For a finite family of fixed graphs let be the smallest integer for which every -coloring of the edges of the complete graph yields a…
On saturation games
Dan Hefetz, Michael Krivelevich, Alon Naor +1
A graph is said to be saturated with respect to a monotone increasing graph property , if but for…
Avoider-Enforcer star games
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy +3
In this paper, we study Avoider-Enforcer games played on the edge set of the complete graph on vertices. For every constant we analyse the -star game, wh…
Component Games on Regular Graphs
Rani Hod, Alon Naor
We study the (1:b) Maker-Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to build a large connected component, while Breaker's aim…
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…
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…