Skip to main content
Log in

The facets of the spanning trees polytope

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

Graphic Abstract

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  • Bondy JA, Murty USR (2008) Graph theory. Springer, New York

    Book  Google Scholar 

  • Chaourar B (2002) On greedy bases packing in matroids. Eur J Comb 23:769–776

    Article  MathSciNet  Google Scholar 

  • Chaourar B (2008) On the kth best basis of a matroid. Oper Res Lett 36(2):239–242

    Article  MathSciNet  Google Scholar 

  • Chaourar B (2011) A characterization of uniform matroids. ISRN Algebra 2011:1–4

    Article  MathSciNet  Google Scholar 

  • Chaourar B (2018) The facets of the bases polytope of a matroid and two consequences. Open J Discr Math 8(1):14–20

    Article  Google Scholar 

  • Edmonds J (1970) Submodular functions, matroids, and certain polyhedra. In: Combinatorial structures and their applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), 69–87

  • Feichtner EM, Sturmfels B (2005) Matroid polytopes, nested sets and bergman fans. Portugaliae Math 62(4):437–468

    MathSciNet  MATH  Google Scholar 

  • Fujishige S (1984) A characterization of faces of the base polyhedron associated with a submodular system. J Oper Res Soc Japan 27:112–128

    MathSciNet  MATH  Google Scholar 

  • Grotschel M (1977) Polyedrische charakterisierungen kombinatorischer optimierungsproblem. Math Syst Econ 36

  • Hibi T, Lason M, Matsuda K, et al (2019) Gorenstein graphic matroids. ArXiv:1905.05418

  • Kolbl M (2020) Gorenstein graphic matroids from multigraphs. Ann Comb 24:395–403

    Article  MathSciNet  Google Scholar 

  • Oxley JG (1992) Matroid theory. Oxford University Press, Oxford

    MATH  Google Scholar 

  • Pulleyblank WR (1989) Polyhedral combinatorics. In: Nemhauser GL (ed) Handbooks in operations research and management science. Elsevier, Amsterdam, pp 371–446

    Google Scholar 

  • Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin

    MATH  Google Scholar 

Download references

Acknowledgements

The author is grateful to Smail Djebali and anonymous referees for their valuable remarks in a previous version of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Brahim Chaourar.

Ethics declarations

Conflict of interest

The (single) author states that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chaourar, B. The facets of the spanning trees polytope. Math Meth Oper Res 96, 113–121 (2022). https://doi.org/10.1007/s00186-022-00786-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-022-00786-w

Keywords

Navigation