Combinatorics of flag simplicial 3-polytopes
From MaRDI portal
Publication:5262208
Abstract: In the focus of this paper is the operation of edge contraction. One can show that simplicial 3-polytope is flag iff contraction of any its edge gives simplicial 3-polytope. Our main result states that any flag simplicial 3-polytope can be reduced to octahedron by sequence of edge contractions. Using this operation we introduce a partial order on the set of flag simplicial 3-polytopes and study Hasse graph of corresponding poset. We estimate input and output degrees of vertices of this Hasse graph.
Recommendations
Cited in
(13)- Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
- On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices
- Simplicial 2-spheres obtained from non-singular complete fans
- Truncations of simple polytopes and applications
- 3-Sphären mit kleinen Eckenvalenzen. (3-spheres with small valences of the vertices)
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Tetrahedra of flags, volume and homology of SL(3)
- A flag vector of a 3-sphere that is not the flag vector of a 4-polytope
- The flag upper bound theorem for 3- and 5-manifolds
- A remark on the polytopality of an interesting 3-sphere
- A minimal irreducible triangulation of \(\mathbb S^3\)
- Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
- Theory of families of polytopes: fullerenes and Pogorelov polytopes
This page was built for publication: Combinatorics of flag simplicial 3-polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262208)