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.
Update scienceslack.json from shoal-catalog d1cbb60b3b19
Browse files+3 −1 scienceslack.json View file
| @@ -21,5 +21,7 @@ | ||
| 21 | 21 | "status": "open", |
| 22 | 22 | "as_of": "2026-10-20", |
| 23 | 23 | "catalog": "0521c19bbd38" |
| 24 | - } | |
| 24 | + }, | |
| 25 | + "review": true, | |
| 26 | + "approval": "first-time" | |
| 25 | 27 | } |