2019/06/12 by Forcan, Jovana, Mikalački, Mirjana
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1906.05044
We study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on n vertices, Kn, 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.