Creating cycles in Walker-Breaker games
Combinatorics
2016-04-29 v2
Abstract
We consider biased Walker-Breaker games: Walker and Breaker alternately claim edges of the complete graph , Walker taking one edge and Breaker claiming edges in each round, with the constraint that Walker needs to choose her edges according to a walk. As questioned in a paper by Espig, Frieze, Krivelevich and Pegden, we study how long a cycle Walker is able to create and for which biases Walker has a chance to create a cycle of given constant length.
Cite
@article{arxiv.1505.02678,
title = {Creating cycles in Walker-Breaker games},
author = {Dennis Clemens and Tuan Tran},
journal= {arXiv preprint arXiv:1505.02678},
year = {2016}
}
Comments
23 pages, to appear in Discrete Mathematics