MathDB
2 sets of n points each

Source: Polish MO Recond Round 1981 p5

September 9, 2024
combinatoricsgeometrypointscombinatorial geometry

Problem Statement

In the plane there are two disjoint sets A A and B B , each of which consists of n n points, and no three points of the set A∪B A \cup B lie on one straight line. Prove that there is a set of n n disjoint closed segments, each of which has one end in the set A A and the other in the set B B .
Back to ProblemsView on AoPS