ABSTRACT
The matching polytope of a graph G, denoted by ℳ (G), is the convex hull of the set of the incidence vectors of the matchings of G. The graph 𝒢 (ℳ (G)), whose vertices and edges are the vertices and edges of ℳ (G), is the skeleton of the matching polytope of G. In this paper, for an arbitrary graph, we prove that the minimum degree of 𝒢 (ℳ (G)) is equal to the number of edges of G, generalizing a known result for trees. From this, we identify the vertices of the skeleton with the minimum degree and we prove that the union of stars and triangles characterizes regular skeletons of the matching polytopes of graphs.
Keywords:
regular graph; matching polytope; degree of matching
