On approximately Cohen-Macaulay binomial edge ideal
classification
🧮 math.AC
keywords
cohen-macaulayapproximatelybinomialclassesedgegraphsidealintroduced
read the original abstract
Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being Cohen-Macaulay, named approximately Cohen-Macaulay, was introduced by S. Goto in [3]. We study classes of graphs whose binomial edge ideal are approximately Cohen-Macaulay. Moreover we use some homological methods in order to compute their Hilbert series.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.