arXiv Analytics

Sign in

arXiv:1912.03900 [math.CO]AbstractReferencesReviewsResources

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

Aleksandr N. Maksimenko, Dmitry V. Gribanov, Dmitry S. Malyshev

Published 2019-12-09Version 1

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 $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,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 $f_0(P)$ for $f_0(P) \le d + 10$.

Comments: 13 pages, 10 figures, 3 algorithms
Categories: math.CO
Subjects: 52Bxx
Related articles: Most relevant | Search more
arXiv:1904.03638 [math.CO] (Published 2019-04-07)
2-neighborly 0/1-polytopes of dimension 7
arXiv:1004.3281 [math.CO] (Published 2010-04-19)
Lower bounds for identifying codes in some infinite grids
arXiv:1306.4941 [math.CO] (Published 2013-06-20)
Upper and lower bounds on $B_k^+$-sets