Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Sequentially Cohen–Macaulay binomial edge ideals of closed graphs

Sequentially Cohen–Macaulay binomial edge ideals of closed graphs 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Research in the Mathematical Sciences Springer Journals

Sequentially Cohen–Macaulay binomial edge ideals of closed graphs

Loading next page...
 
/lp/springer-journals/sequentially-cohen-macaulay-binomial-edge-ideals-of-closed-graphs-neLQOVcXyz
Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2022
eISSN
2197-9847
DOI
10.1007/s40687-022-00334-2
Publisher site
See Article on Publisher Site

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.

Journal

Research in the Mathematical SciencesSpringer Journals

Published: Sep 1, 2022

Keywords: Binomial edge ideals; Closed graphs; Sequentially Cohen–Macaulay ideals; Approximately Cohen–Macaulay ideals; 13H10; 05E40; 13C70

References