# Linear Bounds for Cycle-free Saturation Games

@article{English2022LinearBF,
title={Linear Bounds for Cycle-free Saturation Games},
author={Sean English and Tom'avs Masavr'ik and Grace McCourt and Erin Meger and Michael S. Ross and Sam Spiro},
journal={ArXiv},
year={2022},
volume={abs/2108.05295}
}
• Published 11 August 2021
• Mathematics, Computer Science
• ArXiv

### On saturation games

• Mathematics
Eur. J. Comb.
• 2016

### Game saturation of intersecting families

• Mathematics
• 2012
We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = {1, 2, …, n} alternately, one at each turn, so that both players are allowed to pick sets

### The Game Saturation Number of a Graph

• Mathematics
J. Graph Theory
• 2017
The lower bound on the length under optimal play of the P_4-saturation game on K_{m,n} is proved, which is similar to the results when Min plays first.

### ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS

In 1940 TURIN raised the following question: if the number of nodes, n, of a graph’ is prescribed and if I is an integer cs n, what is the number of edges which the graph has to contain in order to

### F-saturation games

• Computer Science
Discret. Math.
• 2015