On strong avoiding games

by   Miloš Stojaković, et al.
University of Novi Sad

Given an increasing graph property F, the strong Avoider-Avoider F game is played on the edge set of a complete graph. Two players, Red and Blue, take turns in claiming previously unclaimed edges with Red going first, and the player whose graph possesses F first loses the game. If the property F is "containing a fixed graph H", we refer to the game as the H game. We prove that Blue has a winning strategy in two strong Avoider-Avoider games, P_4 game and CC_>3 game, where CC_>3 is the property of having at least one connected component on more than three vertices. We also study a variant, the strong CAvoider-CAvoider games, with additional requirement that the graph of each of the players must stay connected throughout the game. We prove that Blue has a winning strategy in the strong CAvoider-CAvoider games S_3 and P_4, as well as in the Cycle game, where the players aim at avoiding all cycles.


page 1

page 2

page 3

page 4


Connected Subtraction Games on Subdivided Stars

The present paper deals with connected subtraction games in graphs, whic...

Linear Bounds for Cycle-free Saturation Games

Given a family of graphs ℱ, we define the ℱ-saturation game as follows. ...

A generalization of Arc-Kayles

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

On the Graceful Game

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

A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks

The online feasibility problem (for a set of sporadic tasks) asks whethe...

Calculating Ultra-Strong and Extended Solutions for Nine Men's Morris, Morabaraba, and Lasker

The strong solutions of Nine Men's Morris and its variant, Lasker Morris...

Dynamics on Games: Simulation-Based Techniques and Applications to Routing

We consider multi-player games played on graphs, in which the players ai...

Please sign up or login with your details

Forgot password? Click here to reset