Fast winning strategies in maker-breaker games
From MaRDI portal
Publication:2519013
Recommendations
Cites work
- A Winning Strategy for the Ramsey Graph Game
- Biased Positional Games
- Biased positional games for which random strategies are nearly optimal
- Combinatorial Games
- Hamiltonian circuits in random graphs
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- On a combinatorial game
- On positional games
- Paths in graphs
- Planarity, Colorability, and Minor Games
- Remarks on positional games. I
Cited in
(51)- On two problems regarding the Hamiltonian cycle game
- A matching game
- Winning fast in biased maker-breaker games
- Sharp thresholds for half-random games. II
- Waiter-client triangle-factor game on the edges of the complete graph
- A strategy for isolator in the toucher-isolator game on trees
- Fast winning strategies for the maker-breaker domination game
- On the WalkerMaker-WalkerBreaker games
- On the odd cycle game and connected rules
- Fast strategies in Waiter-Client games
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game
- Maker-breaker domination number
- The toucher-isolator game
- Strong Ramsey games: drawing on an infinite board
- How fast can maker win in fair biased games?
- Weak and strong \(k\)-connectivity games
- The speed and threshold of the biased perfect matching and Hamilton cycle games
- Creating cycles in walker-breaker games
- Fast embedding of spanning trees in biased maker-breaker games
- Hitting time results for maker-breaker games
- Walker-breaker games
- Building spanning trees quickly in maker-breaker games
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Fast strategies in maker-breaker games played on random boards
- Winning fast in fair biased maker-breaker games
- Hamiltonian maker-breaker games on small graphs
- Generating random graphs in biased maker-breaker games
- Fast winning strategies in positional games
- Winning Fast in Sparse Graph Construction Games
- Fast embedding of spanning trees in biased maker-breaker games
- Fast strategies in biased Maker-Breaker games
- A Winning Strategy for the Ramsey Graph Game
- Spanning Structures in Walker–Breaker Games
- Strong games played on random graphs
- Biased games on random boards
- Efficient winning strategies in random-turn maker-breaker games
- The Game Saturation Number of a Graph
- Hitting time results for maker-breaker games (extended abstract)
- Building spanning trees quickly in maker-breaker games
- Winning strong games through fast strategies for weak games
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
- Global maker-breaker games on sparse graphs
- Maker-breaker domination game on trees when Staller wins
- Maker-breaker domination number for Cartesian products of path graphs \(P_2\) and \(P_n\)
- Complexity of maker-breaker games on edge sets of graphs
- Tree universality in positional games
- Fast winning strategies for the attacker in eternal domination
- Constructions for positional games and applications to domination games
- Fast winning strategies in avoider-enforcer games
- Random-player maker-breaker games
- On winning fast in Avoider-Enforcer games
This page was built for publication: Fast winning strategies in maker-breaker games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519013)
