Linear Bounds for Cycle-free Saturation Games

by   Sean English, et al.
Iowa State University of Science and Technology
University of Illinois at Urbana-Champaign
Charles University in Prague

Given a family of graphs ℱ, we define the ℱ-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 ℱ. 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 sat_g(n,ℱ) denote the number of edges that are in the final graph when both players play optimally. In general there are very few non-trivial bounds on the order of magnitude of sat_g(n,ℱ). In this work, we find collections of infinite families of cycles 𝒞 such that sat_g(n,𝒞) has linear growth rate.


page 1

page 2

page 3

page 4


On strong avoiding games

Given an increasing graph property F, the strong Avoider-Avoider F game ...

A generalization of Arc-Kayles

The game Arc-Kayles is played on an undirected graph with two players ta...

A vertex and edge deletion game on graphs

Starting with a graph, two players take turns in either deleting an edge...

On the Graceful Game

A graceful labeling of a graph G with m edges consists of labeling the v...

e-Valuate: A Two-player Game on Arithmetic Expressions -- An Update

e-Valuate is a game on arithmetic expressions. The players have contrast...

Let's Play Mahjong!

Mahjong is a very popular tile-based game commonly played by four player...

Bounds on Ramsey Games via Alterations

This note contains a refined alteration approach for constructing H-free...

Please sign up or login with your details

Forgot password? Click here to reset