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.
graph theorycombinatorics