A 3-regular matchstick graph of girth 5 consisting of 54 vertices
Combinatorics
2020-01-09 v2
Abstract
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.
Cite
@article{arxiv.1903.04304,
title = {A 3-regular matchstick graph of girth 5 consisting of 54 vertices},
author = {Mike Winkler and Peter Dinkelacker and Stefan Vogel},
journal= {arXiv preprint arXiv:1903.04304},
year = {2020}
}
Comments
4 pages, 1 figure