1 Result(s)

Article

A Tight Bound for the Number of Edges of Matchstick Graphs

A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introduced these graphs in 1981 and conjectured that the maximum number of edges for a matchstick graph on n vertices ...

Jérémy Lavollée, Konrad Swanepoel in Discrete & Computational Geometry (2023)