Please use this identifier to cite or link to this item: https://doi.org/10.15480/882.3667
DC FieldValueLanguage
dc.contributor.authorClemens, Dennis-
dc.contributor.authorKirsch, Laurin-
dc.contributor.authorMogge, Yannick-
dc.date.accessioned2021-07-16T07:28:07Z-
dc.date.available2021-07-16T07:28:07Z-
dc.date.issued2021-07-02-
dc.identifier.citationElectronic Journal of Combinatorics 28 (3): P3.10 (2021)de_DE
dc.identifier.issn1077-8926de_DE
dc.identifier.urihttp://hdl.handle.net/11420/9906-
dc.description.abstractThe 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).en
dc.language.isoende_DE
dc.publisherEMIS ELibEMSde_DE
dc.relation.ispartofThe electronic journal of combinatoricsde_DE
dc.rights.urihttps://creativecommons.org/licenses/by-nd/4.0/de_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleConnector-Breaker games on random boardsde_DE
dc.typeArticlede_DE
dc.identifier.doi10.15480/882.3667-
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-882.0140054-
tuhh.oai.showtruede_DE
tuhh.abstract.englishThe 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).de_DE
tuhh.publisher.doi10.37236/9381-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.identifier.doi10.15480/882.3667-
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.issue3de_DE
tuhh.container.volume28de_DE
dc.rights.nationallicensefalsede_DE
dc.identifier.scopus2-s2.0-85108972059de_DE
tuhh.container.articlenumberP3.10de_DE
local.status.inpressfalsede_DE
local.type.versionpublishedVersionde_DE
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.languageiso639-1en-
item.grantfulltextopen-
item.creatorOrcidClemens, Dennis-
item.creatorOrcidKirsch, Laurin-
item.creatorOrcidMogge, Yannick-
item.mappedtypeArticle-
item.creatorGNDClemens, Dennis-
item.creatorGNDKirsch, Laurin-
item.creatorGNDMogge, Yannick-
item.fulltextWith Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0001-5940-6556-
crisitem.author.orcid0000-0003-4239-9112-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
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
Thumbnail
Show simple item record

Page view(s)

157
Last Week
0
Last month
7
checked on Aug 8, 2022

Download(s)

60
checked on Aug 8, 2022

Google ScholarTM

Check

Note about this record

Cite this record

Export

This item is licensed under a Creative Commons License Creative Commons