Convex polytopes without triangular faces (Q2640145): Difference between revisions

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.