Almost cyclic polytopes (Q580718): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Quotient polytopes of cyclic polytopes. I: Structure and characterization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On combinatorial and affine automorphisms of polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5547252 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5621733 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Neighborly polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How many cyclic subpolytopes can a non-cyclic polytope have? / rank | |||
Normal rank |
Latest revision as of 11:24, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost cyclic polytopes |
scientific article |
Statements
Almost cyclic polytopes (English)
0 references
1987
0 references
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.
0 references
almost-cyclic
0 references
neighborly 2m-polytopes
0 references
universal edges
0 references