论文信息 - A family of neighborly polytopes

A family of neighborly polytopes

Ad-polytopeP is said to be neighborly provided each [d/2] vertices determine a face ofP. We construct a family ofd-polytopes that are dual to neighborly polytopes by means of facet splitting. We use this family to find a lower bound on the number of combinatorial types of neighborly polytopes. We also show that all members of this family satisfy the famous Hirsch conjecture.

David Barnette

[1] B. Grünbaum,et al. An enumeration of simplicial 4-polytopes with 8 vertices , 1967 .

[2] V. Klee. Diameters of Polyhedral Graphs , 1964, Canadian Journal of Mathematics.

[3] H. Rademacher. On the number of certain types of polyhedra , 1965 .

[4] V. Klee,et al. Thed-step conjecture for polyhedra of dimensiond<6 , 1967 .

[5] David Barnette. Generalized combinatorial cells and facet splitting , 1975 .

[6] V. Klee. Paths on polyhedra. II. , 1964 .

[7] V. Klee. Paths on Polyhedra. I , 1965 .

[8] Amos Altshuler,et al. Neighborly 4-Polytopes with 9 Vertices , 1973, J. Comb. Theory, Ser. A.

[9] P. McMullen. The maximum numbers of faces of a convex polytope , 1970 .