Regular Matchstick Graphs
Sascha Kurz, Rom Pinchasi · American Mathematical Monthly · 2011
A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.