On the clique-game
From MaRDI portal
Publication:649002
Recommendations
Cites work
- scientific article; zbMATH DE number 3970795 (Why is no real title available?)
- scientific article; zbMATH DE number 524119 (Why is no real title available?)
- scientific article; zbMATH DE number 932175 (Why is no real title available?)
- A Winning Strategy for the Ramsey Graph Game
- Asymptotic random graph intuition for the biased connectivity game
- Biased Positional Games
- Biased positional games and the phase transition
- Biased positional games on matroids
- Combinatorial Games
- Deterministic Graph Games and a Probabilistic Intuition
- Paths in graphs
- Planarity, Colorability, and Minor Games
- Positional games on random graphs
- Ramsey games
- The diameter game
Cited in
(12)- The random graph intuition for the tournament game
- Building spanning trees quickly in maker-breaker games
- Cliques and constructors in ``Hats game. II
- The Clique Corona Operation and Greedoids
- The threshold bias of the clique-factor game
- An Achievement Game on a Cycle
- Weak and strong \(k\)-connectivity games
- A strategy for isolator in the toucher-isolator game on trees
- The toucher-isolator game
- Thresholds for the monochromatic clique transversal game
- Clique is hard on average for regular resolution
- The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles
This page was built for publication: On the clique-game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649002)