Almost cyclic polytopes
From MaRDI portal
A 2m-polytope (m\(\geq 2)\) P is neighborly if every m vertices of P determine a face of P. An edge E of P is universal if conv(E\(\cup S)\) is a face of P for every set of m-1 vertices of P. The author has proved previously [Isr. J. Math. 43, 291-314 (1982; Zbl 0598.05010)] that if P has v vertices, it has at most v universal edges. In the reviewed paper a) it is shown that P cannot have v-1 universal edges, b) there are completely described all neighborly 2m-polytopes with v vertices having v-2 universal edges.
Recommendations
- Triangulations of cyclic polytopes
- Characterizations of cyclic polytopes
- Subpolytopes of cyclic polytopes
- Cyclic polytopes and oriented matroids
- Cyclohedron and Kantorovich-Rubinstein polytopes
- The almost simple cubical polytopes
- Cyclic polytopes and d-order curves
- Facets of the p-cycle polytope
- scientific article; zbMATH DE number 4058316
Cites work
- How many cyclic subpolytopes can a non-cyclic polytope have?
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- Neighborly polytopes
- On combinatorial and affine automorphisms of polytopes
- Quotient polytopes of cyclic polytopes. I: Structure and characterization
Cited in
(8)- How many cyclic subpolytopes can a non-cyclic polytope have?
- Neighborly polytopes
- A characterization of cyclic polytopes by continued fractions
- Cyclic polytopes and oriented matroids
- Characterizations of cyclic polytopes
- Secondary polytope of a cyclic 8-polytope with 12 vertices
- scientific article; zbMATH DE number 3907274 (Why is no real title available?)
- Cubillages of cyclic zonotopes
This page was built for publication: Almost cyclic polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580718)
