The facets of the spanning trees polytope

Brahim Chaourar ()
Additional contact information
Brahim Chaourar: Imam Mohammad Ibn Saud Islamic University (IMSIU)

Mathematical Methods of Operations Research, 2022, vol. 96, issue 1, No 4, 113-121

Abstract: Abstract Let $$G=(V, E)$$ 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. Graphic Abstract

Keywords: Spanning trees; Polytope; Facets; Matroid; Bases polytope; Locked subgraphs (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00186-022-00786-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:96:y:2022:i:1:d:10.1007_s00186-022-00786-w

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-022-00786-w

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().