A threshold for the maker-breaker clique game
From MaRDI portal
Publication:2925528
Recommendations
Cites work
- A Solution of the Shannon Switching Game
- A sharp threshold for the Hamilton cycle Maker–Breaker game
- Asymptotic random graph intuition for the biased connectivity game
- Biased Positional Games
- Biased positional games for which random strategies are nearly optimal
- Clique percolation
- Combinatorial Games
- Hitting time results for maker-breaker games
- Positional games and the second moment method
- Positional games on random graphs
- Regularity and Positional Games
- Sharp thresholds of graph properties, and the $k$-sat problem
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- Threshold functions
Cited in
(15)- Maker-breaker games on random geometric graphs
- Playing to retain the advantage
- Maker-Breaker games on randomly perturbed graphs
- On the Chvàtal-Erdős triangle game
- A new bound for the Maker-Breaker triangle game
- Cliques and constructors in ``Hats game. II
- Waiter-client triangle-factor game on the edges of the complete graph
- A remark on the tournament game
- The threshold bias of the clique-factor game
- On the clique-game
- Complexity of maker-breaker games on edge sets of graphs
- On the threshold for the maker-breaker \(H\)-game
- Client-waiter games on complete and random graphs
- Thresholds for the monochromatic clique transversal game
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
This page was built for publication: A threshold for the maker-breaker clique game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925528)