Problem

Source: Iran 3rd round 2012-Combinatorics exam-P1

Tags: algorithm, combinatorics proposed, combinatorics



We've colored edges of $K_n$ with $n-1$ colors. We call a vertex rainbow if it's connected to all of the colors. At most how many rainbows can exist? Proposed by Morteza Saghafian