Let $G=(V, E)$ be an undirected graph. The spanning trees polytope $P(G)$ is the convex hull of the 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 of a matroid.

October 13, 2019

Loading full text...

Similar articles

Loading recommendations...

x1

The facets of the spanning trees polytope

Click on play to start listening