We consider the one-color graph avoidance game. Using a high-performance computing network, we showed that the first player can win the game on 13, 14, and 15 vertices. Other related games are also discussed.
