The edges of K10 (complete graph on 10-nodes) are to be colored with c colors, such that the following condition is true: for any subset of c vertices of K10,
all c di erent colors must appear at least once in their induced subgraph.

Prove that then c must be atleast 5.