Convex polyhedron


Unsolved problems

"In 1975, G. C. Shephard asked whether every convex polyhedron has at least one net. This question, which is also known as Durer's conjecture, or Durer's unfolding problem, remains unanswered." Does every convex polyhedron have at least one net?


THEOREM    Euler's polyhedron formula https://en.wikipedia.org/wiki/Euler_characteristic#Polyhedra

Proof unavailable