Problem

Source: Tuymaada Olympiad 2019 juniors p5

Tags: graph theory, graph, combinatorics, combinatorial geometry



Is it possible to draw in the plane the graph presented in the figure so that all the vertices are different points and all the edges are unit segments? (The segments can intersect at points different from vertices.)


Attachments: