Cohen-Macaulay property of binomial edge ideals with girth of graphs (Q6597509)

Binomial edge ideals, associated to graphs, are a generalization of determinantal ideals, frequently used in Combinatorics and Algebraic Statistics.\N\NA main open problem in this area is to classify Cohen-Macaulay binomial edges ideals combinatorially. Based on results by \textit{D. Bolognini} et al. [J. Algebr. Comb. 55, No. 4, 1139--1170 (2022; Zbl 1496.13036)] and \textit{A. Conca} and \textit{M. Varbaro} [Invent. Math. 221, No. 3, 713--730 (2020; Zbl 1451.13076)], the authors give necessary conditions for a binomial edge ideal to be Cohen-Macaulay (Proposition 3.6 and 3.8) and show that for the characterization of Cohen-Macaulay binomial edge ideals it is enough to consider biconnected graphs with attached whiskers (Theorem 3.13 and 3.14, Corollary 3.16 and 3.17).\N\NFinally, the paper relates the Cohen-Macaulay property of binomial edge ideals to the girth invariant of graphs (Theorem 4.2).