Access the full text.
Sign up today, get DeepDyve free for 14 days.
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.
Research in the Mathematical Sciences – Springer Journals
Published: Sep 1, 2022
Keywords: Binomial edge ideals; Closed graphs; Sequentially Cohen–Macaulay ideals; Approximately Cohen–Macaulay ideals; 13H10; 05E40; 13C70
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.