ASU 008 All Russian MO 1961 9.3 combinatorial geometry
Source:
June 17, 2019
combinatoricscombinatorial geometry
Problem Statement
Given points, some of them connected by non-intersecting segments. You can reach every point from every one, moving along the segments, and there is no couple, connected by two different ways. Prove that the total number of the segments is .