Abstract
AbstractThe perfectly matchable subgraph polytope of a graph is a (0,1)-polytope associated with the vertex sets of matchings in the graph. In this paper, we study algebraic properties (compressedness, Gorensteinness) of the toric rings of perfectly matchable subgraph polytopes. In particular, we give a complete characterization of a graph whose perfectly matchable subgraph polytope is compressed.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference34 articles.
1. Balas, E., Pulleyblank, W.R.: The perfectly matchable subgraph polytopes of a bipartite graph. Networks 13, 495–516 (1983)
2. Balas, E., Pulleyblank, W.R.: The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica 9, 321–337 (1989)
3. Batyrev, V.V.: Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties. J. Algebr. Geom. 3(3), 493–535 (1994)
4. Cao, D., Nemhauser, G.L.: Polyhedral characterizations and perfection of line graphs. Discrete Appl. Math. 81, 141–154 (1998)
5. Davis, R., Kohl, F.: Perfectly matchable set polynomials and $$h^{*}$$-polynomials for stable set polytopes of complements of graphs. arXiv:2207.14759