Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs) (Q1092413)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs) |
scientific article |
Statements
Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs) (English)
0 references
1987
0 references
It is a well known fact that a simple convex d-polytope is uniquely determined by its 2-skeleton. An old conjecture of M. A. Perles says that it is already uniquely determined by its graph. Here it is proved that the conjecture is true if the 2-faces of the polytope have at most 6 edges.
0 references
graph of a polytope
0 references
simple convex d-polytope
0 references
2-skeleton
0 references
conjecture of M. A. Perles
0 references