| dc.contributor.author |
Saha, Kamalesh |
|
| dc.contributor.author |
Sengupta, Indranath |
|
| dc.date.accessioned |
2021-05-14T05:18:47Z |
|
| dc.date.available |
2021-05-14T05:18:47Z |
|
| dc.date.issued |
2021-04 |
|
| dc.identifier.citation |
Saha, Kamalesh and Sengupta, Indranath, "Construction of Cohen-Macaulay binomial edge ideals of graphs and clutters", arXiv, Cornell University Library, DOI: arXiv:2104.14143, Apr. 2021. |
en_US |
| dc.identifier.uri |
http://arxiv.org/abs/2104.14143 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/6478 |
|
| dc.description.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 |
|
| dc.description.statementofresponsibility |
by Kamalesh Saha and Indranath Sengupta |
|
| dc.language.iso |
en_US |
en_US |
| dc.publisher |
Cornell University Library |
en_US |
| dc.title |
Construction of Cohen-Macaulay binomial edge ideals of graphs and clutters |
en_US |
| dc.type |
Pre-Print |
en_US |
| dc.relation.journal |
arXiv |
|