Please use this identifier to cite or link to this item:
Publisher DOI: 10.37236/9381
Title: Connector-Breaker games on random boards
Language: English
Authors: Clemens, Dennis  
Kirsch, Laurin 
Mogge, Yannick 
Issue Date: 2-Jul-2021
Publisher: EMIS ELibEMS
Source: Electronic Journal of Combinatorics 28 (3): P3.10 (2021)
Abstract (english): 
The Maker-Breaker connectivity game on a complete graph Kn or on a random graph G ∼ Gn,p is well studied by now. Recently, London and Pluhár suggested a variant in which Maker always needs to choose her edges in such a way that her graph stays connected. It follows from their results that for this connected version of the game, the threshold bias on Kn and the threshold probability on G ∼ Gn,p for winning the game drastically differ from the corresponding values for the usual Maker-Breaker version, assuming Maker’s bias to be 1. However, they observed that the threshold biases of both versions played on Kn are still of the same order if instead Maker is allowed to claim two edges in every round. Naturally, London and Pluhár then asked whether a similar phenomenon can be observed when a (2: 2) game is played on Gn,p. We prove that this is not the case, and determine the threshold probability for winning this game to be of size n−2/3+o(1).
DOI: 10.15480/882.3667
ISSN: 1077-8926
Journal: The electronic journal of combinatorics 
Institute: Mathematik E-10 
Document Type: Article
License: CC BY-ND 4.0 (Attribution-NoDerivatives) CC BY-ND 4.0 (Attribution-NoDerivatives)
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
9381-PDF file-36693-1-10-20210625.pdfVerlags-PDF650,46 kBAdobe PDFView/Open
Show full item record

Page view(s)

Last Week
Last month
checked on Jul 5, 2022


checked on Jul 5, 2022

Google ScholarTM


Note about this record

Cite this record


This item is licensed under a Creative Commons License Creative Commons