DC FieldValueLanguage
dc.contributor.authorClemens, Dennis-
dc.contributor.authorEhrenmüller, Julia-
dc.contributor.authorPerson, Yury-
dc.contributor.authorTran, Tuan-
dc.date.accessioned2021-08-04T11:17:17Z-
dc.date.available2021-08-04T11:17:17Z-
dc.date.issued2015-03-06-
dc.identifier.citationElectronic Journal of Combinatorics 22 (1): P1.60, 1-12 (2015-03-06)de_DE
dc.identifier.issn1077-8926de_DE
dc.identifier.urihttp://hdl.handle.net/11420/10042-
dc.description.abstractWe consider biased (1:b) Avoider-Enforcer games in the monotone and strict versions. In particular, we show that Avoider can keep his graph being a forest for every but maybe the last round of the game if b ²00nlnn. By this we obtain essentially optimal upper bounds on the threshold biases for the non-planarity game, the non-k-colorability game, and the K-minor game thus addressing a question and improving the results of Hefetz, Krivelevich, Stojakovic, and Szabo. Moreover, we give a slight improvement for the lower bound in the non-planarity game.en
dc.language.isoende_DE
dc.publisherEMIS ELibEMSde_DE
dc.relation.ispartofThe electronic journal of combinatoricsde_DE
dc.subjectAvoider-Enforcerde_DE
dc.subjectPlanarity gamede_DE
dc.subjectPositional gamesde_DE
dc.subjectThreshold biasde_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleKeeping Avoider’s graph almost acyclicde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.abstract.englishWe consider biased (1:b) Avoider-Enforcer games in the monotone and strict versions. In particular, we show that Avoider can keep his graph being a forest for every but maybe the last round of the game if b ²00nlnn. By this we obtain essentially optimal upper bounds on the threshold biases for the non-planarity game, the non-k-colorability game, and the K-minor game thus addressing a question and improving the results of Hefetz, Krivelevich, Stojakovic, and Szabo. Moreover, we give a slight improvement for the lower bound in the non-planarity game.de_DE
tuhh.publisher.doi10.37236/4859-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.issue1de_DE
tuhh.container.volume22de_DE
tuhh.container.startpage1de_DE
tuhh.container.endpage12de_DE
dc.identifier.scopus2-s2.0-84924236083de_DE
tuhh.container.articlenumberP1.60de_DE
local.status.inpressfalsede_DE
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.languageiso639-1en-
item.grantfulltextnone-
item.creatorOrcidClemens, Dennis-
item.creatorOrcidEhrenmüller, Julia-
item.creatorOrcidPerson, Yury-
item.creatorOrcidTran, Tuan-
item.mappedtypeArticle-
item.creatorGNDClemens, Dennis-
item.creatorGNDEhrenmüller, Julia-
item.creatorGNDPerson, Yury-
item.creatorGNDTran, Tuan-
item.fulltextNo 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-0002-3091-3025-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

32
Last Week
0
Last month
1
checked on Aug 8, 2022

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
checked on Jun 29, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.