A remark on the tournament game

From MaRDI portal
Publication:888601

zbMATH Open1323.05089arXiv1503.02885MaRDI QIDQ888601FDOQ888601


Authors: Dennis Clemens, Mirjana Mikalački Edit this on Wikidata


Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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, and Maker wins if by the end of the game she claims all the edges of a pre-defined goal tournament. 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 mathcalGn,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.


Full work available at URL: https://arxiv.org/abs/1503.02885

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (4)





This page was built for publication: A remark on the tournament game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888601)