Let A be a set of n points in the space. From the family of all segments with endpoints in A, q segments have been selected and colored yellow. Suppose that all yellow segments are of different length. Prove that there exists a polygonal line composed of m yellow segments, where m≥n2q, arranged in order of increasing length. combinatoricscombinatorial geometrygraph theoryExtremal combinatoricsExtremal Graph TheoryIMO Shortlist