Problem

Source: Komal A. 683, based on a problem of the Miklós Schweitzer competition

Tags: function, geometry, geometry unsolved, Plane Geometry, graph theory, combinatorics



Let $K=(V, E)$ be a finite, simple, complete graph. Let $\phi: E \to \mathbb{R}^2$ be a map from the edge set to the plane, such that the preimage of any point in the range defines a connected graph on the entire vertex set $V$, and the points assigned to the edges of any triangle are collinear. Show that the range of $\phi$ is contained in a line.