COMBINATORICS
2006
15 years 3 months ago
2006
We completely solve the problem of enumerating combinatorially inequivalent d-dimensional polytopes with d + 3 vertices. A first solution of this problem, by Lloyd, was published ...