In 2010 it was proved that a 3-regular matchstick graph of girth 5 must consist at least of 30 vertices.The smallest known example consisted of 180 vertices. In this article we construct an example consisting of 54 vertices and prove its geometrical correctness.
展开▼
