English

The facets of the spanning trees polytope

Combinatorics 2020-08-18 v4 Discrete Mathematics

Abstract

Let G=(V,E)G=(V, E) be an undirected graph. The spanning trees polytope P(G)P(G) is the convex hull of the characteristic vectors of all spanning trees of GG. In this paper, we describe all facets of P(G)P(G) as a consequence of the facets of the bases polytope P(M)P(M) of a matroid MM, i.e., the convex hull of the characteristic vectors of all bases of MM.

Keywords

Cite

@article{arxiv.1903.07292,
  title  = {The facets of the spanning trees polytope},
  author = {Brahim Chaourar},
  journal= {arXiv preprint arXiv:1903.07292},
  year   = {2020}
}

Comments

9 pages, 1 included figure

R2 v1 2026-06-23T08:11:03.917Z