Toric rings of perfectly matchable subgraph polytopes
Combinatorics
2023-07-18 v3 Commutative Algebra
Abstract
The 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.
Keywords
Cite
@article{arxiv.2210.17147,
title = {Toric rings of perfectly matchable subgraph polytopes},
author = {Kenta Mori},
journal= {arXiv preprint arXiv:2210.17147},
year = {2023}
}
Comments
22 pages, 3 figures, minor revision