{"title":"Thresholds for the monochromatic clique transversal game","authors":"Csilla Bujtás , Pakanun Dokyeesun , Sandi Klavžar","doi":"10.1016/j.exmath.2022.11.001","DOIUrl":null,"url":null,"abstract":"<div><p>We study a recently introduced two-person combinatorial game, the <span><math><mrow><mo>(</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>)</mo></mrow></math></span>-monochromatic clique transversal game which is played by Alice and Bob on a graph <span><math><mi>G</mi></math></span>. As we observe, this game is equivalent to the <span><math><mrow><mo>(</mo><mi>b</mi><mo>,</mo><mi>a</mi><mo>)</mo></mrow></math></span>-biased Maker–Breaker game played on the clique-hypergraph of <span><math><mi>G</mi></math></span>. Our main results concern the threshold bias <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> that is the smallest integer <span><math><mi>a</mi></math></span> such that Alice can win in the <span><math><mrow><mo>(</mo><mi>a</mi><mo>,</mo><mn>1</mn><mo>)</mo></mrow></math></span>-monochromatic clique transversal game on <span><math><mi>G</mi></math></span> if she is the first to play. Among other results, we determine the possible values of <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> for the disjoint union of graphs, prove a formula for <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> if <span><math><mi>G</mi></math></span> is triangle-free, and obtain the exact values of <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub><mspace></mspace><mo>□</mo><mspace></mspace><msub><mrow><mi>C</mi></mrow><mrow><mi>m</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span>, <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub><mspace></mspace><mo>□</mo><mspace></mspace><msub><mrow><mi>P</mi></mrow><mrow><mi>m</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span>, and <span><math><mrow><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub><mspace></mspace><mo>□</mo><mspace></mspace><msub><mrow><mi>P</mi></mrow><mrow><mi>m</mi></mrow></msub><mo>)</mo></mrow></mrow></math></span> for all possible pairs <span><math><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>m</mi><mo>)</mo></mrow></math></span>.</p></div>","PeriodicalId":50458,"journal":{"name":"Expositiones Mathematicae","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expositiones Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0723086922000676","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
We study a recently introduced two-person combinatorial game, the -monochromatic clique transversal game which is played by Alice and Bob on a graph . As we observe, this game is equivalent to the -biased Maker–Breaker game played on the clique-hypergraph of . Our main results concern the threshold bias that is the smallest integer such that Alice can win in the -monochromatic clique transversal game on if she is the first to play. Among other results, we determine the possible values of for the disjoint union of graphs, prove a formula for if is triangle-free, and obtain the exact values of , , and for all possible pairs .
期刊介绍:
Our aim is to publish papers of interest to a wide mathematical audience. Our main interest is in expository articles that make high-level research results more widely accessible. In general, material submitted should be at least at the graduate level.Main articles must be written in such a way that a graduate-level research student interested in the topic of the paper can read them profitably. When the topic is quite specialized, or the main focus is a narrow research result, the paper is probably not appropriate for this journal. Most original research articles are not suitable for this journal, unless they have particularly broad appeal.Mathematical notes can be more focused than main articles. These should not simply be short research articles, but should address a mathematical question with reasonably broad appeal. Elementary solutions of elementary problems are typically not appropriate. Neither are overly technical papers, which should best be submitted to a specialized research journal.Clarity of exposition, accuracy of details and the relevance and interest of the subject matter will be the decisive factors in our acceptance of an article for publication. Submitted papers are subject to a quick overview before entering into a more detailed review process. All published papers have been refereed.