Simple 0/1-Polytopes

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For general polytopes, it has turned out that with respect to many questions it suffices to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very different within the class of 0/1-polytopes, since every simple 0/1-polytope is the (cartesian) product of some 0/1-simplices (which proves a conjecture of Ziegler), and thus, the restriction to simple 0/1-polytopes leaves only a very small class of objects with a rather trivial structure. © 2000 Academic Press.

Cite

CITATION STYLE

APA

Kaibel, V., & Wolff, M. (2000). Simple 0/1-Polytopes. European Journal of Combinatorics, 21(1), 139–144. https://doi.org/10.1006/eujc.1999.0328

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