Problem

Source: Federation of Bosnia, 2. Grades 2008.

Tags: floor function, function, combinatorics proposed, combinatorics



$ n$ points (no three being collinear) are given in a plane. Some points are connected and they form $ k$ segments. If no three of these segments form triangle ( equiv. there are no three points, such that each two of them are connected) prove that $ k \leq \left \lfloor \frac {n^{2}}{4}\right\rfloor$