Abstract
We prove that, for sufficiently large $n$, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On strong avoiding games;Discrete Mathematics;2023-03
2. Maker–Breaker Games with Constraints;Trends in Mathematics;2021
3. Strong Ramsey games in unbounded time;European Journal of Combinatorics;2020-05
4. How fast can Maker win in fair biased games?;Discrete Mathematics;2018-01
5. Strong Ramsey games: Drawing on an infinite board;Journal of Combinatorial Theory, Series A;2017-08