Neighborly polytopes (Q1079566)

In this paper the author deals with neighborly 2m-polytopes. A 2m- polytope Q is neighborly if each m vertices of Q determine a face. It is shown that the combinatorial structure of a neighborly 2m-polytope determines the combinatorial structure of every subpolytope. Also the author obtains lower bounds for the number g(v,2m) of combinatorial types of neighborly 2m-polytopes with v vertices. He proves that \(g(2m+4,2m)\) increases superexponentially with m, and g(v,m) tends to infinity superexponentially with v for each fixed \(m\geq 2\).