A matchstick graph is a crossing-free unit-distance graph in the plane.
...
We show that a matchstick graph with n vertices has no more than
3n-c√(n...
Let S be a set of n points in Euclidean 3-space. Assign to each x∈
S a d...
Given a set of sources and a set of sinks as points in the Euclidean pla...