Mirjana Mikalački ; Miloš Stojaković - Fast strategies in biased Maker--Breaker games

dmtcs:4033 - Discrete Mathematics & Theoretical Computer Science, October 8, 2018, vol. 20 no. 2 - https://doi.org/10.23638/DMTCS-20-2-6
Fast strategies in biased Maker--Breaker gamesArticle

Authors: Mirjana Mikalački ; Miloš Stojaković ORCID

    We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on $b$, in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.

    Volume: vol. 20 no. 2
    Section: Graph Theory
    Published on: October 8, 2018
    Accepted on: September 21, 2018
    Submitted on: October 31, 2017
    Keywords: Mathematics - Combinatorics,91A24 Positional games, 91A43 Games involving graphs, 91A46 Combinatorial games
      Source : OpenAIRE Graph
    • Numerical Linear Algebra and Discrete Structures; Funder: Ministry of Education, Science and Technological Development of Republic of Serbia; Code: 174019

    Consultation statistics

    This page has been seen 513 times.
    This article's PDF has been downloaded 327 times.