F-saturation games

DOI10.1016/J.DISC.2015.05.028MaRDI QIDQ2515577zbMATH OpenOpenAlexFDO

Authors Jonathan Lee, Ago-Erik Riet

Publication date 5 August 2015

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

saturation game

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Abstract: We study F-saturation games, first introduced by F"uredi, Reimer and Seress in 1991, and named as such by West. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We show lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding game and the star avoiding game.

Recommendations

• Graph saturation games
• The game of \(\mathcal F\)-saturator
• The Game Saturation Number of a Graph
• Linear bounds for cycle-free saturation games
• Saturation games for odd cycles

Cites work

• An upper bound on the extremal version of Hajnal's triangle-free game
• scientific article; zbMATH DE number 140096 (Why is no real title available?)
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• On maximal paths and circuits of graphs

Cited in

(9)

• Linear bounds for cycle-free saturation games
• Game saturation of intersecting families
• Saturation games for odd cycles
• Graph saturation games
• Path Saturation Game on Six Vertices
• The constructor-blocker game
• The \(P_5\)-saturation game
• Generalized saturation game
• The game of \(\mathcal F\)-saturator

This page was built for publication: \(\mathcal{F}\)-saturation games

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