On the number of edges of restricted matchstick graphs

Panna Gehér, János Pach, Konrad Swanepoel +1

A graph whose vertices are points in the plane and whose edges are noncrossing straight-line segments of unit length is called a \emph{matchstick graph}. We prove two somewhat coun…