The facets of the spanning trees polytope

03/18/2019

∙

by   Brahim Chaourar, et al.

∙

0

∙

share

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.