On the WalkerMaker-WalkerBreaker games
Combinatorics
2019-06-13 v1
Abstract
We study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on vertices, , a variant of well-known Maker-Breaker positional games, where both players have the restriction on the way of playing. Namely, each player has to choose her/his edges according to a walk. Here, we focus on two standard graph games - the Connectivity game and the Hamilton cycle game and show how quickly WalkerMaker can win both games.
Keywords
Cite
@article{arxiv.1906.05044,
title = {On the WalkerMaker-WalkerBreaker games},
author = {Jovana Forcan and Mirjana Mikalački},
journal= {arXiv preprint arXiv:1906.05044},
year = {2019}
}