|Publisher DOI:||10.37236/5142||Title:||A remark on the tournament game||Language:||English||Authors:||Clemens, Dennis
|Keywords:||Maker-Breaker; positional games; tournament||Issue Date:||4-Sep-2015||Publisher:||EMIS ELibEMS||Source:||Electronic Journal of Combinatorics 3 (22): P3.42, 1-18 (2015)||Abstract (english):||
We study the Maker-Breaker tournament game played on the edge set of a given graph G. Two players, Maker and Breaker, claim unclaimed edges of G in turns, while Maker additionally assigns orientations to the edges that she claims. If by the end of the game Maker claims all the edges of a pre-defined goal tournament, she wins the game. Given a tournament Tk on k vertices, we determine the threshold bias for the (1: b) Tk-tournament game on Kn. We also look at the (1: 1) Tk- tournament game played on the edge set of a random graph Gn,p and determine the threshold probability for Maker's win. We compare these games with the clique game and discuss whether a random graph intuition is satisfied.
|URI:||http://hdl.handle.net/11420/7354||ISSN:||1077-8926||Journal:||The electronic journal of combinatorics||Institute:||Mathematik E-10||Document Type:||Article|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Jul 6, 2022
Add Files to Item
Note about this record
Cite this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.