The following pages link to Remarks on positional games. I (Q3663044):
Displaying 50 items.
- Picker-chooser fixed graph games (Q273174) (← links)
- Economical extremal hypergraphs for the Erdős-Selfridge theorem (Q297937) (← links)
- A non-trivial upper bound on the threshold bias of the oriented-cycle game (Q345067) (← links)
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Avoider-forcer games on hypergraphs with small rank (Q405059) (← links)
- Biased orientation games (Q418878) (← links)
- Fast embedding of spanning trees in biased maker-breaker games (Q427795) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- The picker-chooser diameter game (Q708229) (← links)
- Bart--Moe games, JumbleG and discrepancy (Q875049) (← links)
- Economical tight examples for the biased Erdős-Selfridge theorem (Q932605) (← links)
- Some strategies for higher dimensional animal achievement games (Q932671) (← links)
- The biased, distance-restricted \(n\)-in-a-row game for small \(p\) (Q964412) (← links)
- On chooser-picker positional games (Q1044991) (← links)
- A matching game (Q1182968) (← links)
- A characterization on \(n\)-critical economical generalized tic-tac-toe games (Q1208360) (← links)
- Polyomino weak achievement games on 3-dimensional rectangular boards (Q1764904) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- Variations on a game (Q1836601) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- Hamiltonian cycles in bipartite graphs (Q1894704) (← 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)
- A new bound for the Maker-Breaker triangle game (Q2143405) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Keeping avoider's graph almost acyclic (Q2260635) (← links)
- The toucher-isolator game (Q2327219) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Rectangular polyomino set weak \((1,2)\)-achievement games (Q2378512) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- On the biased \(n\)-in-a-row game (Q2581405) (← links)
- The threshold bias of the clique-factor game (Q2664555) (← links)
- Sharp thresholds for half-random games I (Q2953698) (← links)
- The diameter game (Q3055780) (← links)
- Asymptotic random graph intuition for the biased connectivity game (Q3055785) (← links)
- Fast Strategies In Maker–Breaker Games Played on Random Boards (Q3168447) (← links)
- Deterministic Graph Games and a Probabilistic Intuition (Q4306428) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Positional games on random graphs (Q4667863) (← links)
- Expanders Are Universal for the Class of All Spanning Trees (Q4911172) (← links)
- Playing to Retain the Advantage (Q4933596) (← links)
- Maker–Breaker percolation games I: crossing grids (Q4993258) (← links)
- Maker-Breaker Games on Randomly Perturbed Graphs (Q5013573) (← links)
- Spanning Structures in Walker–Breaker Games (Q5066070) (← links)
- Biased games on random boards (Q5265341) (← links)
- Manipulative Waiters with Probabilistic Intuition (Q5366922) (← links)
- Robust Hamiltonicity of Dirac graphs (Q5420107) (← links)
- (Q5743497) (← links)
- Chasing the Threshold Bias of the 3-AP Game (Q5869447) (← links)
