构建者-拦阻者游戏

IF 1 4区数学 Q1 MATHEMATICS

Applicable Analysis and Discrete Mathematics Pub Date : 2023-01-01 DOI:10.2298/aadm220723022p

Balázs Patkós, Milos Stojakovic, Máté Vizer

{"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}

引用次数: 1

摘要

给定两个图F和H, Constructor和Blocker轮流声明完全图Kn的未声明边。构造函数?s的图形必须保持无f，而Blocker则不受限制地声明边缘。当构造函数不能声明进一步的边或所有边都已被声明时，游戏结束。本场比赛的比分是H?s在构造函数?年代图。构造函数?他的目标是使分数最大化，而布洛克则试图使分数最小化。我们研究了F和H的几种选择。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The constructor-blocker game

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 MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

2.40

自引率

11.10%

发文量

审稿时长

>12 weeks

期刊介绍： 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/).