The constructor-blocker game
From MaRDI portal
Recommendations
Cites work
- \(\mathcal{F}\)-saturation games
- A note on the one-colour avoidance game on graphs
- An upper bound on the extremal version of Hajnal's triangle-free game
- Combinatorial Games
- Game saturation of intersecting families
- Generalized Turán problems for disjoint copies of graphs
- Generalized Turán problems for even cycles
- scientific article; zbMATH DE number 140096 (Why is no real title available?)
- scientific article; zbMATH DE number 1735736 (Why is no real title available?)
- scientific article; zbMATH DE number 970802 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- Many \(T\) copies in \(H\)-free graphs
- On Hajnal's triangle-free game
- On saturation games
- Positional games
- The first player wins the one-colour triangle avoidance game on 16 vertices
- The Game Saturation Number of a Graph
- The history of degenerate (bipartite) extremal graph problems
- The maximum number of P_\ell copies in P_k-free graphs
- The maximum number of cliques in graphs without long cycles
- Vraagstuk XXVIII.
This page was built for publication: The constructor-blocker game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567845)