On the k-Systems of a Simple Polytope

dc.creatorJoswig, Michael
dc.creatorKaibel, Volker
dc.creatorK"orner, Friederike
dc.date2000-12-20
dc.date2001-06-27
dc.date.accessioned2026-07-07T04:39:21Z
dc.date.available2026-07-07T04:39:21Z
dc.descriptionA k-system of the graph G(P) of a simple polytope P is a set of induced subgraphs of G(P) that shares certain properties with the set of subgraphs induced by the k-faces of P. This new concept leads to polynomial-size certificates in terms of G(P) for both the set of vertex sets of facets as well as for abstract objective functions (AOF) in the sense of Kalai. Moreover, it is proved that an acyclic orientation yields an AOF if and only if it induces a unique sink on every 2-face.
dc.description8 pages, 3 figures, LaTeX 2e
dc.identifierhttps://arxiv.org/abs/math/0012204
dc.identifierhttp://arxiv.org/abs/math/0012204
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60626
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52B05; 05C99
dc.titleOn the k-Systems of a Simple Polytope
dc.typetext

Files

Collections