at most 3n-6 segments by n distinct points under conditions
Source: 1976 German Federal - Bundeswettbewerb Mathematik - BWM - Round 1 p4
November 20, 2022
geometrycombinatoricscombinatorial geometry
Problem Statement
In a plane are given distinct points. Some pairs of these points are connected by segments so that no two of the segments intersect. Prove that there are at most segments.