$(S_2)$-condition and Cohen–Macaulay binomial edge ideals
Open Access
- 5 October 2022
- journal article
- research article
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 57 (2) , 589-615
Abstract
We describe the simplicial complex $$\Delta $$ such that the initial ideal of the binomial edge ideal $$J_\textrm{G}$$ of G is the Stanley-Reisner ideal of $$\Delta $$ . By using $$\Delta $$ we show that if $$J_\textrm{G}$$ is $$(S_2)$$ , then G is accessible. We also characterize all accessible blocks with whiskers of cycle rank 3 and we define a new infinite class of accessible blocks with whiskers for any cycle rank. Finally, by using a computational approach, we show that the graphs with at most 12 vertices whose binomial edge ideal is Cohen–Macaulay are all and only the accessible ones.
Keywords
All Related Versions
Funding Information
- Università degli Studi di Trento
This publication has 15 references indexed in Scilit:
- Cohen–Macaulay binomial edge ideals of cactus graphsJournal of Algebra and Its Applications, 2019
- Cartwright–Sturmfels ideals associated to graphs and linear spacesJournal of Combinatorial Algebra, 2018
- Binomial edge ideals of bipartite graphsEuropean Journal of Combinatorics, 2018
- Graph connectivity and binomial edge idealsProceedings of the American Mathematical Society, 2016
- Some Cohen–Macaulay and Unmixed Binomial Edge IdealsCommunications in Algebra, 2015
- Construction of Cohen–Macaulay Binomial Edge IdealsCommunications in Algebra, 2013
- Cohen-Macaulay binomial edge idealsNagoya Mathematical Journal, 2011
- Graphs and Ideals Generated by Some 2-MinorsCommunications in Algebra, 2011
- Binomial edge ideals and conditional independence statementsAdvances in Applied Mathematics, 2010
- GRAPH THEORY1969