The facets of the spanning trees polytope
Abstract
Let G=(V, E) be an undirected graph. The spanning trees polytope P(G) is the convex hull of the characteristic vectors of all spanning trees of G. In this paper, we describe all facets of P(G) as a consequence of the facets of the bases polytope P(M) of a matroid M, i.e., the convex hull of the characteristic vectors of all bases of M.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.