Saturation games for odd cycles

zbMath1422.05070arXiv1808.03696MaRDI QIDQ2327225

Sam Spiro

Publication date: 14 October 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(\mathcal{F}\)-saturation game\(\{C_3\}\)-saturation game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Linear bounds for cycle-free saturation games ⋮ Impartial hypergraph games

Cites Work

• Unnamed Item
• Graph saturation games
• On saturation games
• An upper bound on the extremal version of Hajnal's triangle-free game
• Game saturation of intersecting families
• Game matching number of graphs
• \(\mathcal{F}\)-saturation games
• The first player wins the one-colour triangle avoidance game on 16 vertices
• The Game Saturation Number of a Graph

This page was built for publication: Saturation games for odd cycles