SCHWEITZER 1996 Problem 2
A complete graph is in a plane such that no three of its vertices are collinear. The edges of the graph, which are straight segments connecting the vertices, are colored with two colors. Prove that there is a non-self-intersecting spanning tree consisting of edges of the same color.
Dataset text AI-MO AoPS. 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.
Similar problems
These problems have the most words in common with this statement.