Join
Dürer's problem: edge-unfolding convex polyhedra
Prove that every convex polyhedron can be cut along its edges and unfolded flat in one piece without overlap, or find one that cannot.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.