Suppose Alice has a winning strategy for the vertex coloring game on a graph G with k colors. Does she have one for k+1 colors?

Open the “Games on graphs” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)