Sequentially Cohen–Macaulay binomial edge ideals of closed graphs

Viviana Ene, Giancarlo Rinaldo, Naoki Terai

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we provide a full combinatorial characterization of sequentially Cohen–Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen–Macaulay if and only if it is almost Cohen–Macaulay.

Original languageEnglish
Article number39
JournalResearch in Mathematical Sciences
Volume9
Issue number3
DOIs
Publication statusPublished - Sep 2022

Keywords

  • Approximately Cohen–Macaulay ideals
  • Binomial edge ideals
  • Closed graphs
  • Sequentially Cohen–Macaulay ideals

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Mathematics (miscellaneous)
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Sequentially Cohen–Macaulay binomial edge ideals of closed graphs'. Together they form a unique fingerprint.

Cite this