{"title":"构建者-拦阻者游戏","authors":"Balázs Patkós, Milos Stojakovic, Máté Vizer","doi":"10.2298/aadm220723022p","DOIUrl":null,"url":null,"abstract":"Given two graphs F and H, Constructor and Blocker alternately claim unclaimed edges of the complete graph Kn. Constructor?s graph must remain F-free, while Blocker claims edges without restrictions. The game ends when Constructor cannot claim further edges or when all edges have been claimed. The score of the game is the number of H?s in Constructor?s graph. Constructor?s aim is to maximize the score, while Blocker tries to minimize it. We study this game for several choices of F and H.","PeriodicalId":51232,"journal":{"name":"Applicable Analysis and Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The constructor-blocker game\",\"authors\":\"Balázs Patkós, Milos Stojakovic, Máté Vizer\",\"doi\":\"10.2298/aadm220723022p\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given two graphs F and H, Constructor and Blocker alternately claim unclaimed edges of the complete graph Kn. Constructor?s graph must remain F-free, while Blocker claims edges without restrictions. The game ends when Constructor cannot claim further edges or when all edges have been claimed. The score of the game is the number of H?s in Constructor?s graph. Constructor?s aim is to maximize the score, while Blocker tries to minimize it. We study this game for several choices of F and H.\",\"PeriodicalId\":51232,\"journal\":{\"name\":\"Applicable Analysis and Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Analysis and Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2298/aadm220723022p\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Analysis and Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/aadm220723022p","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Given two graphs F and H, Constructor and Blocker alternately claim unclaimed edges of the complete graph Kn. Constructor?s graph must remain F-free, while Blocker claims edges without restrictions. The game ends when Constructor cannot claim further edges or when all edges have been claimed. The score of the game is the number of H?s in Constructor?s graph. Constructor?s aim is to maximize the score, while Blocker tries to minimize it. We study this game for several choices of F and H.
期刊介绍：
Applicable Analysis and Discrete Mathematics is indexed, abstracted and cover-to cover reviewed in: Web of Science, Current Contents/Physical, Chemical & Earth Sciences (CC/PC&ES), Mathematical Reviews/MathSciNet, Zentralblatt für Mathematik, Referativny Zhurnal-VINITI. It is included Citation Index-Expanded (SCIE), ISI Alerting Service and in Digital Mathematical Registry of American Mathematical Society (http://www.ams.org/dmr/).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
