Generalized saturation game

DOI10.1016/J.DAM.2025.05.014MaRDI QIDQ6965806zbMATH OpenFDO

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

Publication date 30 June 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.05.014

zbMATH Keywords

combinatorial games on graphssaturation games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

Cites work

• \(\mathcal{F}\)-saturation games
• An upper bound on the extremal version of Hajnal's triangle-free game
• Few \(H\) copies in \(F\)-saturated graphs
• Graph saturation games
• scientific article; zbMATH DE number 140096 (Why is no real title available?)
• Linear bounds for cycle-free saturation games
• Many \(T\) copies in \(H\)-free graphs
• Minimizing the number of complete bipartite graphs in a K_s-saturated graph
• Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
• On maximal paths and circuits of graphs
• On saturation games
• Saturated graphs with minimal number of edges
• Saturation games for odd cycles
• The constructor-blocker game
• The Game Saturation Number of a Graph

This page was built for publication: Generalized saturation game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965806)