Cohen-Macaulay property of binomial edge ideals with girth of graphs

Conca and Varbaro (2020) [7] showed the equality of depth of a graded ideal and its initial ideal in a polynomial ring when the initial ideal is square-free. In this paper, we give some beautiful applications of this fact in the study of Cohen-Macaulay binomial edge ideals. We prove that for the characterization of Cohen-Macaulay binomial edge ideals, it is enough to consider only "biconnected graphs with some whisker attached" and this is done by investigating the initial ideals. We give several necessary conditions for a binomial edge ideal to be Cohen-Macaulay in terms of smaller graphs. Also, under a hypothesis, we give a sufficient condition for Cohen-Macaulayness of binomial edge ideals in terms of blocks of graphs. Moreover, we show that a graph with CohenMacaulay binomial edge ideal has girth less than 5 or equal to infinity. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar