Convex polytopes without triangular faces (Q2640145): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Gerd Blind / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Roswitha Blind / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Mihai Turinici / rank | |||
Normal rank | |||
Revision as of 21:09, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex polytopes without triangular faces |
scientific article |
Statements
Convex polytopes without triangular faces (English)
0 references
1990
0 references
For the convex d-polytopes P without triangular 2-faces, and any \(j\in \{0,...,d-1\},\) the number \(f_ j(P)\) of j-dimensional faces of P attains its minimum in \(P=C_ d\) (the d-cube). Moreover, there exists only one combinatorial type of such polytopes with exactly \(2d+1\) facets.
0 references
convex polytope
0 references
number of d-dimensional faces
0 references
cube
0 references
combinatorial type
0 references
