Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
type: Item
instance of: scholarly article
title: Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
zbMATH Open document ID: 0627.52004
DOI: 10.1007/BF01547950
published in: Monatshefte für Mathematik
publication date: 1987-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/178348
review text: 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.
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 4019883
zbMATH Keywords: graph of a polytope
zbMATH Keywords: simple convex d-polytope
zbMATH Keywords: 2-skeleton
zbMATH Keywords: conjecture of M. A. Perles
author: G. Blind
author: Roswitha Blind
MaRDI profile type: Publication
cites work: Q5547252
cites work: An enumeration of simplicial 4-polytopes with 8 vertices
cites work: The graph of an abstract polytope
cites work: Q3715772
cites work: Einfache, konvexe Polytope und ihre Graphen
cites work: Neighborly polytopes
OpenAlex ID: W150656606
description: scientific article; zbMATH DE number 4019883