2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/75777We show that there exist k-neighborly centrally symmetric d-dimensional polytopes with 2(n+d) vertices, where k(d,n)=Theta(d/(1+log ((d+n)/d))). We also show that this bound is tight.7 pagesCombinatorics52B05; 52B15; 52B35How neighborly can a centrally symmetric polytope be?text