A Symmetric Strategy in Graph Avoidance Games

Frank Harary, Wolfgang Slany, Oleg Verbitsky

In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to…