Saha, Kamalesh; Sengupta, Indranath
(Cornell University Library, 2022-03)
For a graph G, Bolognini et al. have shown JG is strongly unmixed ? JG is Cohen-Macaulay ? G is accessible, where JG denotes the binomial edge ideals of G. Accessible and strongly unmixed properties are purely combinatorial. ...