Fast winning strategies in Avoider-Enforcer games

Simple item page
dc.creatorHefetz, Dan
dc.creatorKrivelevich, Michael
dc.creatorStojaković, Miloš
dc.creatorSzabó, Tibor
dc.date2008-06-02
dc.date.accessioned2026-07-07T09:42:13Z
dc.date.available2026-07-07T09:42:13Z
dc.descriptionIn numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not {\em who} wins but rather {\em how fast} can one win. These type of problems were studied earlier for Maker-Breaker games; here we initiate their study for unbiased Avoider-Enforcer games played on the edge set of the complete graph $K_n$ on $n$ vertices. For several games that are known to be an Enforcer's win, we estimate quite precisely the minimum number of moves Enforcer has to play in order to win. We consider the non-planarity game, the connectivity game and the non-bipartite game.
dc.identifierhttps://arxiv.org/abs/0806.0280
dc.identifierhttp://arxiv.org/abs/0806.0280
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162102
dc.subjectCombinatorics
dc.subject91A24; 68R10
dc.titleFast winning strategies in Avoider-Enforcer games
dc.typetext

Files

Collections

arXiv