Back in 2013, our own Christian Lawson-Perfect came up with a way of making a solid from the smallest non-Hamiltonian graph, the Herschel Graph. Called the Herschel Enneahedron, it’s got nine faces (three squares and six kites) and the same symmetries as the graph itself.
The most recent news is that Spektrum magazine – sort of a German version of New Scientist – has included in its regular puzzle column a Herschel Enneahedron-related challenge. Here’s Google’s best effort at translating it:
Please make a polyhedron of 3 squares and 6 cover-like kite rectangles with suitable dimensions (in your thoughts, drawings or with carton). What symmetry properties does it have, how many corners and edges? Is it possible to make a (Hamilton-) circular path on its edges, which takes each corner exactly once and does not use an edge more than once?
Before you get out your cartons and start working on this, given that we started from a graph which isn’t Hamiltonian, you may have a slight spoiler on the answer here… but the solution given includes some nice videos and explanation as to how the solid is formed.
Treitz Puzzles 313, at Spektrum.de