Problem

Source: Portugal OPM 2015 p6

Tags: combinatorics, combinatorial geometry, geometry



For what values of $n$ is it possible to mark $n$ points on the plane so that each point has at least three other points at distance $1$?