Joswig, MichaelKaibel, VolkerPfetsch, Marc E.Ziegler, Günter M.2018-10-022018-10-0220011615-715Xhttps://depositonce.tu-berlin.de/handle/11303/8281http://dx.doi.org/10.14279/depositonce-7432Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is bounded. In the case of a polyhedron that is simple and ``simplicial,'' i.e., a d-dimensional polyhedron that has d facets through each vertex and d vertices on each facet, we derive from the structure of the vertexfacet incidence matrix that the polyhedron is necessarily bounded. In particular, this yields a characterization of those polyhedra that have circulants as vertex-facet incidence matrices.en510 Mathematikcombinatorial structurepolyhedronvertexincidence matrixArticle1615-7168