Construction of Cohen-Macaulay binomial edge ideals of graphs and clutters
Source
arXiv
Date Issued
2021-04-01
Author(s)
Saha, Kamalesh
Sengupta, Indranath
Abstract
In this paper, starting with an arbitrary graph G, we give a construction of a graph [G] with Cohen-Macaulay binomial edge ideal. We have extended this construction for clutters also. We also discuss unmixed and Cohen-Macaulay properties of binomial edge ideals of subgraphs