The lower bound for the number of facets of a k-neighborly d-polytope with d+3 vertices

Aleksandr Maksimenko

We have found the minimal difference $\Delta (k)=\underset{P}{\min }(f_{d-1}(P)-f_0(P))$ between the number of facets and the number of vertices of a $k$-neighborly $d$-polytope $P$ for…