Network

https://commons.wikimedia.org/wiki/File:Harborth_graph_vector.svg
Image: Wikimedia Commons

I’m just sharing this because I think it’s pretty — it’s the smallest arrangement of identical non-crossing matchsticks that one can make on a tabletop in which each match-end touches three others.

Presented by German mathematician Heiko Harborth in 1986, it’s known as the Harborth graph.