Key points are not available for this paper at this time.
The matching polytope of a graph G is the convex hull of the indicator vectors of the matchings on G. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes possess the integer decomposition property. As a special case study, we examine the matching polytopes of wheel graphs and show that they are not Gorenstein, but do possess the integer decomposition property.
Eisley et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: