All 2-neighborly d-polytopes with at most d + 9 facets

Abstract

We give a complete enumeration of all 2-neighborly d-polytopes with d+9 and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope P6,10,15 with 10 vertices and 15 facets, and pyramids over P6,10,15. In particular, we update the lower bounds for the number of facets of a 2-neighborly d-polytope P and showed that the number of facets of P is not less than the number of its vertices f0(P) for f0(P) d + 10.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…