A simple way to tell a simple polytope from its graph (Q1120602): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0097-3165(88)90064-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074536752 / rank | |||
Normal rank | |||
Revision as of 23:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple way to tell a simple polytope from its graph |
scientific article |
Statements
A simple way to tell a simple polytope from its graph (English)
0 references
1988
0 references
Let P be a simple d-dimensional polytope and G(P) be the graph of P. Two vertices u and v in V(P) are adjacent in G(P) if [v,u] is a 1-dimensional face of P. Recently, \textit{R. Blind} and \textit{P. Mani-Levitska} [Aequationes Math. 34, 287-297 (1987; Zbl 0634.52005)] proved a conjecture of Perles that G(P) determines the entire combinatorial structure of P. In this note the author gives a simple proof of this result.
0 references
acyclic orientation
0 references
regular graph
0 references
polytope
0 references
