Now showing1 - 1 of 1
  • Some of the metrics are blocked by your 
    Item type:Publication, Access status: with files ,
    Variants of Maker-Breaker games on complete and random graphs
    This thesis studies two topics, both of which focus on different variants of positional games. The first topic is the study of fast strategies in Waiter-Client games played on the edge set of the complete graph. We prove results for unbiased games, where the winning sets are perfect matchings, Hamilton cycles, pancyclic graphs, fixed spanning trees, or factors of a given graph. We also consider the biased versions of the perfect matching game and the Hamiltonicity game. The second topic is the study of Connector-Breaker and Walker-Breaker games played on the edge set of a random graph. We prove bounds for the threshold probabilities for Walker's and Breaker's strategies.
    Publicationtype: Doctoral Thesis
      51  317