Linear Bounds for Cycle-free Saturation Games

  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},
Given a family of graphs $\mathcal{F}$, we define the $\mathcal{F}$-saturation game as follows. Two players alternate adding edges to an initially empty graph on $n$ vertices, with the only constraint being that neither player can add an edge that creates a subgraph in $\mathcal{F}$. The game ends when no more edges can be added to the graph. One of the players wishes to end the game as quickly as possible, while the other wishes to prolong the game. We let $\textrm{sat}_g(n,\mathcal{F… 

Figures from this paper

Project Description Sam Spiro

Broadly speaking, questions in extremal combinatorics ask how large or small a combinatorial object can be. For example, a classical theorem of Mantel’s [20] states that every n-vertex triangle-free



Saturation Games for Odd Cycles

It is shown that the number of edges that are in the final graph when both players play optimally is the same, andsat_g(\mathcal{C}_\infty\setminus C_3;n) is proved to be 2n-2, where $k\ge 2$ denotes the set of all odd cycles.

Colorability Saturation Games

Almost matching lower and upper bounds on the score of the game that hold for arbitrary choices of $k$ and $n>k$ are provided and it is proved that its score is $n^2/3+O(n)$.

Saturation Numbers for Trees

The saturation numbers of ${\bf sat}(n,T_k)$ for some families of trees will be determined precisely, and the maximum and minimum values of the saturation number for the class of all Trees will be given.

On saturation games

Game saturation of intersecting families

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

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.

An upper bound on the extremal version of Hajnal's triangle-free game


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

Saturation numbers for families of graph subdivisions

This paper determines exactly for and shows for n sufficiently large that there exists a constant such that *.

F-saturation games