On the number of edges of restricted matchstick graphs

Abstract

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 counterintuitive results concerning the maximum number of edges of such graphs in two different scenarios. First, we show that there is a constant $c>0$ such that every triangle-free matchstick graph on $n$ vertices has at most $2n-c\sqrt{n}$ edges. This statement is not true for any $c>\sqrt{2}.$ We also prove that for every $r>0$, there is a constant $\epsilon (r)>0$ with the property that every matchstick graph on $n$ vertices contained in a disk of radius $r$ has at most $(2-\epsilon (r))n$ edges.

10 pages, 3 figures