2000 character limit reached
The facets of the spanning trees polytope
Published 18 Mar 2019 in math.CO and cs.DM | (1903.07292v4)
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.