2000 character limit reached
On approximately Cohen-Macaulay binomial edge ideal
Published 4 Jan 2013 in math.AC | (1301.0784v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.