MathNet 1990 — Part 01 Question 54

A graph has $n$ points and $n(n-1)/2$ edges. Each edge is colored with one of $k$ colors so that there are no closed monochrome paths. What is the largest possible value of $n$ (given $k$)?