paper

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

arXiv:1912.03900

Abstract

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

13 pages, 10 figures, 3 algorithms

References in corpus (1)