2 papers
math.CO2025
Penny graphs in the hyperbolic plane
Ádám Sagmeister, Konrad J. Swanepoel
We consider the problem of finding the maximum number of pairs of touching circles in a packing of congruent circles of diameter in the hyperbolic plane of curvatu…
math.CO2025
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…