Facets of the (s,t)-p-path polytope
Abstract
We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p. First, we point out how the (s,t)-p-path polytope is located in the family of path and cycle polyhedra. Next, we give some classes of valid inequalities which are very similar to inequalities which are valid for the p-cycle polytope, that is, the convex hull of the incidence vectors of simple cycles of length p in D. We give necessary and sufficient conditions for these inequalities to be facet defining. Furthermore, we consider a class of inequalities that has been identified to be valid for (s,t)-paths of cardinality at most p. Finally, we transfer the results to related polytopes, in particular, the undirected counterpart of the (s,t)-p-path polytope.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.