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.
Sequentially Cohen–Macaulay binomial edge ideals of closed graphs
Rinaldo G.;
2022-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
