Shephard's problem (a.k.a. Dürer's conjecture)

does every convex polyhedron have a net, or simple edge-unfolding?

Open the “Euclidean geometry” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)