Y by
Let be a complete directed graph with vertices and let be a positive integer. Angel and Boris play the following game: Angel colors of the edges in red and puts a pawn in one of the vertices. After that in each move, first Angel moves the pawn to a neighboring vertex and then Boris has to flip one of the non-colored edges. Boris wins if at some point Angel can't make a move. Find, depending on and , whether or not Boris has a winning strategy.
This post has been edited 2 times. Last edited by topologicalsort, Nov 16, 2024, 8:18 PM