The facets of the spanning trees polytope
نویسندگان
چکیده
Let $G=(V, E)$ be an undirected graph. The spanning trees polytope $P(G)$ is the convex hull of characteristic vectors all $G$. In this paper, we describe facets as a consequence bases $P(M)$ matroid $M$, i.e., $M$.
منابع مشابه
The Circuit Polytope: Facets
Given an undirected graph G = (V;E) and a cost vector c 2 IRE , the weighted girth problem is to nd a circuit in G having minimum total cost. This problem is in general NP-hard since the traveling salesman problem can be reduced to it. A promising approach to hard combinatorial optimization problems is given by the so-called cutting plane methods. These involve linear programming techniques bas...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNew facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on an incomplete graph with 2n vertices, no method was available until recently for using this correspondence to derive facets of the symmetric traveling salesman polytope from facets of the asymmetric one. In this paper w...
متن کاملOn the facets of the secondary polytope
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope – corresponding to the triangulations of A – are very well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are...
متن کاملCritical Facets of the Stable Set Polytope
A facet of the stable set polytope of a graph G can be viewed as a generalization of the notion of an-critical graph. We extend several results from the theory of-critical graphs to facets. The defect of a nontrivial, full-dimensional facet P v2V a(v)x v b of the stable set polytope of a graph G is deened by = P v2V a(v) ?2b. We prove the upper bound a(u) + for the degree of any vertex u in a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2022
ISSN: ['0042-0573', '1432-5217', '1432-2994']
DOI: https://doi.org/10.1007/s00186-022-00786-w