Problem #PRU-60874

Problem

$N$ points are given, no three of which lie on one line. Each two of these points are connected by a segment, and each segment is coloured in one of the $k$ colours. Prove that if $N>\lfloor k!e\rfloor$, then among these points one can choose three such that all sides of the triangle formed by them will be colored in one colour.