The Game Saturation Number of a Graph

DOI10.1002/jgt.22074zbMath1365.05195arXiv1405.2834OpenAlexW2963671784MaRDI QIDQ5272930

James M. Carraher, William B. Kinnersley, Douglas B. West, Benjamin Reiniger

Publication date: 5 July 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2834

zbMATH Keywords

spanning treesaturation numberforbidden subgraphgraph game

Mathematics Subject Classification ID

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

Related Items (5)

Linear bounds for cycle-free saturation games ⋮ An upper bound on the extremal version of Hajnal's triangle-free game ⋮ On saturation games ⋮ Saturation games for odd cycles ⋮ Graph cover-saturation

Cites Work

• On saturation games
• A survey of minimum saturated graphs
• An upper bound on the extremal version of Hajnal's triangle-free game
• The game of \(\mathcal F\)-saturator
• The early evolution of the \(H\)-free process
• On maximal intersecting families of finite sets
• New asymptotics for bipartite Turán numbers
• Game matching number of graphs
• Fast winning strategies in maker-breaker games
• A note on the random greedy independent set algorithm
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Winning Fast in Sparse Graph Construction Games
• Planarity, Colorability, and Minor Games
• Saturated graphs with minimal number of edges
• On the size of a random maximal graph
• A Problem in Graph Theory

This page was built for publication: The Game Saturation Number of a Graph