Biased Positional Games
From MaRDI portal
Publication:4152069
DOI10.1016/S0167-5060(08)70335-2zbMath0374.90086OpenAlexW71466766MaRDI QIDQ4152069
No author found.
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
Related Items (79)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Creating cycles in walker-breaker games ⋮ Fast Strategies In Maker–Breaker Games Played on Random Boards ⋮ Avoider-Enforcer games ⋮ A solution to the Box Game ⋮ A new bound for the Maker-Breaker triangle game ⋮ A note on biased and non-biased games ⋮ A Hamiltonian game on \(K_{n,n}\) ⋮ Hitting time results for Maker-Breaker games ⋮ Generating random graphs in biased Maker-Breaker games ⋮ Spanning Structures in Walker–Breaker Games ⋮ A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ A threshold for the Maker-Breaker clique game ⋮ Chasing the Threshold Bias of the 3-AP Game ⋮ The threshold bias of the clique-factor game ⋮ Deterministic Graph Games and a Probabilistic Intuition ⋮ Walker-Breaker Games ⋮ On the WalkerMaker-WalkerBreaker games ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Avoider-Enforcer games played on edge disjoint hypergraphs ⋮ A remark on the tournament game ⋮ Random-player maker-breaker games ⋮ Maker-breaker total domination game ⋮ Global maker-breaker games on sparse graphs ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Graph Tilings in Incompatibility Systems ⋮ Maker Breaker on digraphs ⋮ Sharp thresholds for half-random games I ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ Fast winning strategies in positional games ⋮ Random strategies are nearly optimal for generalized van der Waerden games ⋮ Winning fast in biased maker-breaker games ⋮ The maker-breaker largest connected subgraph game ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ MAKER–BREAKER GAMES ON AND ⋮ Biased orientation games ⋮ Multistage positional games ⋮ On the odd cycle game and connected rules ⋮ Fast strategies in Waiter-Client games ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ The Random Graph Intuition for the Tournament Game ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ The speed and threshold of the biased perfect matching and Hamilton cycle games ⋮ On the clique-game ⋮ The game chromatic number of dense random graphs ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Generalized pairing strategies -- a bridge from pairing strategies to colorings ⋮ A new upper bound on the game chromatic index of graphs ⋮ Component Games on Regular Graphs ⋮ Avoider-enforcer: the rules of the game ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Keeping avoider's graph almost acyclic ⋮ Biased positional games on matroids ⋮ Sharp thresholds for half-random games. II ⋮ The picker-chooser diameter game ⋮ Playing to Retain the Advantage ⋮ The diameter game ⋮ Connector-breaker games on random boards ⋮ The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 ⋮ Fast winning strategies in maker-breaker games ⋮ Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs ⋮ Hamiltonian Maker–Breaker Games on Small Graphs ⋮ An Achievement Game on a Cycle ⋮ On the separation conjecture in avoider-enforcer games ⋮ Maker-Breaker domination game ⋮ Maker–Breaker percolation games I: crossing grids ⋮ Variations on a game ⋮ The toucher-isolator game ⋮ Remarks on positional games. I ⋮ Avoider-Enforcer: The Rules of the Game ⋮ Playing to retain the advantage ⋮ Van der Waerden and Ramsey type games ⋮ Maker‐breaker games on random geometric graphs ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Biased games on random boards ⋮ On strong avoiding games ⋮ Efficient Winning Strategies in Random‐Turn Maker–Breaker Games ⋮ Directed switching games on graphs and matroids ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs
This page was built for publication: Biased Positional Games
