RU-ALLRUSSIAN 1978 Problem 12
Given a set of n non- intersecting segments in the plane. No two segments lie on the same line. Can we successively add n- 1 additional segments so that we end up with a single non- intersecting path? Each segment we add must have as its endpoints two existing segment endpoints.
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.