The following pages link to (Q3737462):
Displaying 25 items.
- A non-trivial upper bound on the threshold bias of the oriented-cycle game (Q345067) (← links)
- Hamilton cycles in highly connected and expanding graphs (Q624184) (← links)
- On the clique-game (Q649002) (← links)
- The picker-chooser diameter game (Q708229) (← links)
- Avoider-enforcer: the rules of the game (Q966059) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- A Hamiltonian game on \(K_{n,n}\) (Q1896354) (← links)
- Maker-breaker percolation games. II: Escaping to infinity (Q1984532) (← links)
- Strong Ramsey games in unbounded time (Q1987092) (← links)
- Combinatorial game distributions of Steiner systems (Q2121748) (← links)
- A new bound for the Maker-Breaker triangle game (Q2143405) (← links)
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Avoider-Enforcer: the rules of the game (Q2851474) (← links)
- Sharp thresholds for half-random games I (Q2953698) (← links)
- Asymptotic random graph intuition for the biased connectivity game (Q3055785) (← links)
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 (Q3074554) (← links)
- (Q3716855) (← links)
- Positional games on random graphs (Q4667863) (← links)
- Maker–Breaker percolation games I: crossing grids (Q4993258) (← links)
- The Random Graph Intuition for the Tournament Game (Q5364264) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
- Robust Hamiltonicity of Dirac graphs (Q5420107) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- Multistage positional games (Q6156060) (← links)
