1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2022★ 1 cited
A tight bound for the number of edges of matchstick graphs
Jérémy Lavollée, Konrad Swanepoel
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…
math.CO2022
The number of small-degree vertices in matchstick graphs
Jérémy Lavollée, Konrad J. Swanepoel
A matchstick graph is a crossing-free unit-distance graph in the plane. Harborth (1981) proposed the problem of determining whether there exists a matchstick graph in which every v…
math.CO2021
Bounding the number of edges of matchstick graphs
Jérémy Lavollée, Konrad J. Swanepoel
We show that a matchstick graph with vertices has no more than edges, where . The main tools in the proof are the E…