Fast strategies in biased Maker-Breaker games
From MaRDI portal
Publication:4560259
Abstract: We study the biased Maker--Breaker positional games, played on the edge set of the complete graph on vertices, . Given Breaker's bias , possibly depending on , we determine the bounds for the minimal number of moves, depending on , in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.
Recommendations
Cited in
(17)- The biased odd cycle game
- Biased positional games and small hypergraphs with large covers
- Multistage positional games
- On winning fast in Avoider-Enforcer games
- Creating cycles in walker-breaker games
- Winning fast in biased maker-breaker games
- Fast winning strategies in positional games
- Biased positional games on matroids
- Fast strategies in Waiter-Client games
- Winning fast in fair biased maker-breaker games
- Maker-breaker resolving game
- Biased orientation games
- Fast winning strategies in maker-breaker games
- A strategy for isolator in the toucher-isolator game on trees
- Complexity of maker-breaker games on edge sets of graphs
- The speed and threshold of the biased perfect matching and Hamilton cycle games
- How fast can maker win in fair biased games?
This page was built for publication: Fast strategies in biased Maker-Breaker games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560259)