scientific article; zbMATH DE number 3970795
From MaRDI portal
Publication:3737462
Recommendations
Cited in
(32)- A note on biased and non-biased games
- A Hamiltonian game on \(K_{n,n}\)
- Maker-breaker percolation games. II: Escaping to infinity
- Strong Ramsey games in unbounded time
- Localization game for random geometric graphs
- Combinatorial game distributions of Steiner systems
- A new bound for the Maker-Breaker triangle game
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
- Waiter-client and client-waiter Hamiltonicity games on random graphs
- Avoider-Enforcer games
- Avoider-Enforcer: the rules of the game
- Sharp thresholds for half-random games. I.
- Asymptotic random graph intuition for the biased connectivity game
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- A non-trivial upper bound on the threshold bias of the oriented-cycle game
- scientific article; zbMATH DE number 3945911 (Why is no real title available?)
- Positional games on random graphs
- Maker–Breaker percolation games I: crossing grids
- Strong games played on random graphs
- scientific article; zbMATH DE number 969183 (Why is no real title available?)
- Product rule wins a competitive game
- The random graph intuition for the tournament game
- Manipulative waiters with probabilistic intuition
- Robust Hamiltonicity of Dirac graphs
- Probabilistic intuition holds for a class of small subgraph games
- Graph Tilings in Incompatibility Systems
- Multistage positional games
- Hamilton cycles in highly connected and expanding graphs
- On the clique-game
- The picker-chooser diameter game
- An improved upper bound on the threshold bias of the Oriented-cycle game
- Avoider-enforcer: the rules of the game
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737462)
