Mirjana Mikalacki

Learn More
We study the (a : a) Maker-Breaker games played on the edge set of the complete graph on n vertices. In the following four games – perfect matching game, Hamil-tonicity game, star factor game and path factor game, our goal is to determine the least number of moves which Maker needs in order to win these games. Moreover, for all games except for the star(More)
In this paper, we study (1 : b) Avoider-Enforcer games played on the edge set of the complete graph on n vertices. For every constant k ≥ 3 we analyse the k-star game, where Avoider tries to avoid claiming k edges incident to the same vertex. We analyse both versions of Avoider-Enforcer games – the strict and the monotone – and for each provide explicit(More)
  • 1