Skip to main content
Journal ArticleOPEN ACCESS

Every simplicial polytope with at most d + 4 vertices is a quotient of a neighborly polytope

Discrete and Computational Geometry (1997) 18(4) 455-462
DOI: 10.1007/PL00009328
9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that every simplicial d-polytope with d + 4 vertices is a quotient of a neighborly (2d + 4)-polytope with 2d + 8 vertices, using the technique of affine Gale diagrams. The result is extended to matroid polytopes.

Cite

CITATION STYLE

APA

Kortenkamp, U. H. (1997). Every simplicial polytope with at most d + 4 vertices is a quotient of a neighborly polytope. Discrete and Computational Geometry, 18(4), 455–462. https://doi.org/10.1007/PL00009328

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free