Applicable Analysis and Discrete Mathematics, issue 00, pages 22
The constructor-blocker game
Balázs Patkós
1
,
Miloš Stojaković
2
,
Máté Vizer
1
Publication type: Journal Article
Publication date: 2023-10-10
scimago Q2
SJR: 0.483
CiteScore: 2.4
Impact factor: 1
ISSN: 14528630, 2406100X
Applied Mathematics
Discrete Mathematics and Combinatorics
Analysis
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.
Found
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.