Problem

Source: Iranian TST 2022 problem 9

Tags: graph theory, Trees, combinatorics



consider $n\geq 6$ points $x_1,x_2,\dots,x_n$ on the plane such that no three of them are colinear. We call graph with vertices $x_1,x_2,\dots,x_n$ a "road network" if it is connected, each edge is a line segment, and no two edges intersect each other at points other than the vertices. Prove that there are three road networks $G_1,G_2,G_3$ such that $G_i$ and $G_j$ don't have a common edge for $1\leq i,j\leq 3$. Proposed by Morteza Saghafian