Papex

Open problem · Mathematics · since 1975 · Open

Dürer’s unfolding problem (Shephard’s conjecture)

Can every convex polyhedron be cut along some of its edges and unfolded flat into a single piece without overlaps?

Summary

G. C. Shephard asked in 1975 whether every convex polyhedron has such a net, or simple edge-unfolding; the question is also known as Dürer’s conjecture. Some non-convex polyhedra have no net, and every convex polyhedron can be unfolded if its faces may first be subdivided.

Source

Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics