$(S_2)$-condition and Cohen-Macaulay binomial edge ideals

Authors:
  • ALAlberto Lerda
    Alberto Lerda
  • CMCarla Mascia
    Carla Mascia
  • GRGiancarlo Rinaldo
    Giancarlo Rinaldo
  • FRFrancesco Romeo
    Francesco Romeo

Abstract
In this work, we provide a simplicial complex $\Delta$ such that the initial ideal of $J_G$ coincides with the Stanley-Reisner ideal of $\Delta$. The latter allows us to prove that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with whiskers of cycle rank 3. Furthermore, we define a new infinite class of blocks, called chain of cycles. By adding whiskers to such blocks, we give necessary and sufficient conditions to have a Cohen-Macaulay binomial edge ideal. Finally, by using a computational approach, we show that the graphs with at most 11 vertices whose binomial edge ideal is Cohen-Macaulay are all and only the accessible ones.