Author:
FELDHEIM OHAD N.,KRIVELEVICH MICHAEL
Abstract
A graph construction game is a Maker–Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graphKN. Maker's aim is to claim a copy of a given target graphGwhile Breaker's aim is to prevent Maker from doing so. In this paper we show that ifGis ad-degenerate graph onnvertices andN>d1122d+9n, then Maker can claim a copy ofGin at mostd1122d+7nrounds. We also discuss a lower bound on the number of rounds Maker needs to win, and the gap between these bounds.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference9 articles.
1. Ramsey games
2. On a combinatorial game
3. A Winning Strategy for the Ramsey Graph Game
4. Combinatorial Games
5. The magnitude of generalized Ramsey numbers for graphs;Burr;Infinite and Finite Sets I,1975
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Game Saturation Number of a Graph;Journal of Graph Theory;2016-09-16
2. Game matching number of graphs;Discrete Applied Mathematics;2013-09
3. Size Ramsey Number of Bounded Degree Graphs for Games;Combinatorics, Probability and Computing;2013-06-11
4. Hitting time results for Maker-Breaker games;Random Structures & Algorithms;2011-12-31