The constructor-blocker game

DOI10.2298/AADM220723022PMaRDI QIDQ6567845

Balázs Patkós, Miloš Stojaković, Máté Vizer

Publication date: 5 July 2024

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

games on graphspositional gamessaturation games

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On saturation games
• An upper bound on the extremal version of Hajnal's triangle-free game
• On Hajnal's triangle-free game
• Vraagstuk XXVIII.
• The maximum number of cliques in graphs without long cycles
• Generalized Turán problems for even cycles
• Game saturation of intersecting families
• Generalized Turán problems for disjoint copies of graphs
• Positional games
• \(\mathcal{F}\)-saturation games
• The first player wins the one-colour triangle avoidance game on 16 vertices
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• The Game Saturation Number of a Graph
• Combinatorial Games
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Many \(T\) copies in \(H\)-free graphs

Related Items (1)

On the Constructor-Blocker game

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)