Tag Archives: Eric Friedman

Telling a Simple Polytope From its Graph

Posted on January 16, 2009 by

Peter Mani  (a photograph by Emo Welzl) Simple polytopes, puzzles   Micha A. Perles conjectured in the ’70s that the graph of a simple -polytope determines the entire combinatorial structure of the polytope. This conjecture was proved in 1987 by Blind … Continue reading →

Posted in Convex polytopes, Open problems | Tagged , , | 4 Comments