Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The facets of the spanning trees polytope (1903.07292v4)

Published 18 Mar 2019 in math.CO and cs.DM

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$.

Summary

We haven't generated a summary for this paper yet.