Biased Positional Games
From MaRDI portal
Publication:4152069
DOI10.1016/S0167-5060(08)70335-2zbMATH Open0374.90086OpenAlexW71466766MaRDI QIDQ4152069FDOQ4152069
Authors:
Publication date: 1978
Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70335-2
Recommendations
- On Biased Positional Games
- Biased positional games on matroids
- Biased orientation games
- scientific article; zbMATH DE number 1354920
- Biased games on random boards
- scientific article; zbMATH DE number 3946179
- Biased positional games for which random strategies are nearly optimal
- Biased positional games and the phase transition
Cited In (87)
- Multistage positional games
- The cordiality game and the game cordiality number
- Building spanning trees quickly in maker-breaker games
- Maker-Breaker total domination game on cubic graphs
- Fast winning strategies in positional games
- A new bound for the Maker-Breaker triangle game
- Maker Breaker on digraphs
- Chasing the threshold bias of the 3-AP game
- Doubly biased walker-breaker games
- Shutout games on graphs
- The threshold bias of the clique-factor game
- Walker-breaker games on \(G_{n, p}\)
- Hamiltonian maker-breaker games on small graphs
- The maker-breaker largest connected subgraph game
- Complexity of maker-breaker games on edge sets of graphs
- Avoider-Enforcer: the rules of the game
- Playing to retain the advantage
- The speed and threshold of the biased perfect matching and Hamilton cycle games
- Spanning Structures in Walker–Breaker Games
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
- Maker-Breaker games on randomly perturbed graphs
- Playing to retain the advantage
- Avoider-Enforcer games played on edge disjoint hypergraphs
- Maker-breaker percolation games. II: Escaping to infinity
- On the WalkerMaker-WalkerBreaker games
- Van der Waerden and Ramsey type games
- Avoider-forcer games on hypergraphs with small rank
- The diameter game
- Waiter-Client and Client-Waiter planarity, colorability and minor games
- A new upper bound on the game chromatic index of graphs
- Creating cycles in walker-breaker games
- Biased games on random boards
- On the odd cycle game and connected rules
- Fast embedding of spanning trees in biased maker-breaker games
- The picker-chooser diameter game
- Sharp thresholds for half-random games. I.
- Biased positional games for which random strategies are nearly optimal
- A note on biased and non-biased games
- Sharp thresholds for half-random games. II
- Avoider-enforcer: the rules of the game
- Biased positional games and the phase transition
- Winning fast in biased maker-breaker games
- A threshold for the maker-breaker clique game
- A solution to the Box Game
- On strong avoiding games
- Directed switching games on graphs and matroids
- Fast strategies in Waiter-Client games
- Biased positional games on matroids
- Deterministic Graph Games and a Probabilistic Intuition
- On the separation conjecture in avoider-enforcer games
- A Hamiltonian game on \(K_{n,n}\)
- Manipulative waiters with probabilistic intuition
- A remark on the tournament game
- Random-player maker-breaker games
- Global maker-breaker games on sparse graphs
- Connector-breaker games on random boards
- Fast strategies in maker-breaker games played on random boards
- Generating random graphs in biased maker-breaker games
- Maker-breaker total domination game
- Keeping avoider's graph almost acyclic
- Title not available (Why is that?)
- Maker–Breaker percolation games I: crossing grids
- Variations on a game
- Waiter-client and client-waiter Hamiltonicity games on random graphs
- Avoider-Enforcer games
- A non-trivial upper bound on the threshold bias of the oriented-cycle game
- Biased orientation games
- An Achievement Game on a Cycle
- Maker-Breaker domination game
- Efficient winning strategies in random-turn maker-breaker games
- Fast winning strategies in maker-breaker games
- The game chromatic number of dense random graphs
- On the clique-game
- Random strategies are nearly optimal for generalized van der Waerden games
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- MAKER–BREAKER GAMES ON AND
- Hitting time results for maker-breaker games
- Walker-Breaker Games
- The toucher-isolator game
- Local resilience and hamiltonicity maker-breaker games in random regular graphs
- Remarks on positional games. I
- Generalized pairing strategies -- a bridge from pairing strategies to colorings
- Robust Hamiltonicity of Dirac graphs
- Graph Tilings in Incompatibility Systems
- Component games on regular graphs
- Maker-breaker games on random geometric graphs
- The random graph intuition for the tournament game
This page was built for publication: Biased Positional Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152069)
