Fast strategies in biased Maker-Breaker games
From MaRDI portal
(Redirected from 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
(19)- Biased positional games and small hypergraphs with large covers
- Winning fast in biased maker-breaker games
- Biased positional games on matroids
- The biased odd cycle game
- Maker-breaker resolving game
- A strategy for isolator in the toucher-isolator game on trees
- Fast strategies in Waiter-Client games
- How fast can maker win in fair biased games?
- Fast winning strategies in maker-breaker games
- The speed and threshold of the biased perfect matching and Hamilton cycle games
- Creating cycles in walker-breaker games
- Winning fast in fair biased maker-breaker games
- Fast winning strategies in positional games
- Biased orientation games
- Multistage positional games
- Complexity of maker-breaker games on edge sets of graphs
- Fast winning strategies in a generalized van der Waerden game
- Constructions for positional games and applications to domination games
- On winning fast in Avoider-Enforcer 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)