Pages that link to "Item:Q5932750"
From MaRDI portal
The following pages link to Biased positional games for which random strategies are nearly optimal (Q5932750):
Displaying 50 items.
- Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
- Picker-chooser fixed graph games (Q273174) (← links)
- Creating cycles in walker-breaker games (Q284747) (← links)
- Avoider-forcer games on hypergraphs with small rank (Q405059) (← links)
- Biased orientation games (Q418878) (← links)
- Client-waiter games on complete and random graphs (Q504971) (← links)
- On the Chvàtal-Erdős triangle game (Q540061) (← links)
- The picker-chooser diameter game (Q708229) (← links)
- A remark on the tournament game (Q888601) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- Game chromatic index of graphs with given restrictions on degrees (Q954995) (← links)
- On chooser-picker positional games (Q1044991) (← links)
- Random strategies are nearly optimal for generalized van der Waerden games (Q1690015) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- Positional games and the second moment method (Q1848146) (← links)
- Maker-breaker percolation games. II: Escaping to infinity (Q1984532) (← links)
- Sharp thresholds for half-random games. II (Q2014222) (← links)
- Connector-breaker games on random boards (Q2040008) (← links)
- Fast winning strategies for the maker-breaker domination game (Q2132382) (← links)
- A new bound for the Maker-Breaker triangle game (Q2143405) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- On the odd cycle game and connected rules (Q2198973) (← links)
- Fast strategies in Waiter-Client games (Q2200433) (← links)
- Keeping avoider's graph almost acyclic (Q2260635) (← links)
- On the separation conjecture in avoider-enforcer games (Q2312614) (← links)
- Maker-breaker domination number (Q2317950) (← 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)
- Biased positional games and the phase transition (Q2712577) (← links)
- On the threshold for the maker-breaker \(H\)-game (Q2830239) (← links)
- Playing to retain the advantage (Q2851498) (← links)
- A threshold for the maker-breaker clique game (Q2925528) (← links)
- Sharp thresholds for half-random games I (Q2953698) (← links)
- The diameter game (Q3055780) (← links)
- Generating random graphs in biased Maker-Breaker games (Q3460510) (← links)
- Biased Positional Games (Q4152069) (← links)
- The Maker--Breaker Rado Game on a Random Set of Integers (Q4646256) (← links)
- Positional games on random graphs (Q4667863) (← 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)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- Biased games on random boards (Q5265341) (← links)
- Efficient Winning Strategies in Random‐Turn Maker–Breaker Games (Q5272928) (← links)
- The Random Graph Intuition for the Tournament Game (Q5364264) (← links)
- Probabilistic intuition holds for a class of small subgraph games (Q5878563) (← links)
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs (Q6098463) (← links)
- Multistage positional games (Q6156060) (← links)
- Walker-breaker games on \(G_{n, p}\) (Q6635169) (← links)
