Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result as establishing that every combinatorial polyhedron has a realization that allows unfolding to a net. Joseph Malkevitch asked if the reverse holds (in some sense of "reverse"): Is there a combinatorial polyhedron such that, for every realization, and for every spanning cut-tree, it unfolds to a net? In this note we prove the answer is No: every combinatorial polyhedron has a realization and a cut-tree that unfolds with overlap.

翻译：Ghomi证明,每一个锥形多面形都可以通过飞毛腿变形来拉开,这样它就能从边缘翻到一个网[Gho14]。网是一个简单的平面多边形,特别是它不会自我重叠。我们可以通过确定每个组合式多面形都有一个能够向网展开的认知来查看他的结果。Joseph Malkevitch问,反面是否保持(某种“反向”感知 ) : 是否有组合式的圆面形,这样,对于每一个实现的,对于每一个跨越切树的树来说,它都会伸到网上? 在本说明中,我们证明答案是否定的:每个组合式多面形多面形都有一个认识,而切开的树是重叠的。