Faculty of Mathematics and Computer Science, Ovidius University, 900527 Constanta, Romania vivian@univ-ovidius.ro
Jürgen Herzog
Affiliation:
Fachbereich Mathematik, Universität Duisburg-Essen, Campus Essen, 45117 Essen, Germany juergen.herzog@uni-essen.de
Takayuki Hibi
Affiliation:
Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University, Osaka 560-0043, Japan hibi@math.sci.osaka-u.ac.jp
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen-Macaulay.
[1]Bayer, D., Charalambous, H., and Popescu, S., Extremal Betti numbers and applications to monomial ideals, J. Algebra221 (1999), 497–512.Google Scholar
[2]
[2]Dirac, G. A., On rigid circuit graphs, Abh. Math. Semin. Univ. Hambg. 38 (1961), 71–76.CrossRefGoogle Scholar
[3]
[3]Fröberg, R., “On Stanley-Reisner rings” in Topics in Algebra, Polish Scientific Publishers, Warsaw, 1990, 57–70.Google Scholar
[4]
[4]Herzog, J. and Hibi, T., Monomial Ideals, Grad. Texts in Math. 260, Springer, London, 2010.Google Scholar
[5]
[5]Herzog, J., Hibi, T., Hreinsdotir, F., Kahle, T., and Rauh, J., Binomial edge ideals and conditional independence statements, Adv. in Appl. Math. 45 (2010), 317–333.Google Scholar
[6]
[6]Ohtani, M., Graphs and ideals generated by some 2-minors, Comm. Algebra39 (2011), 905–917.Google Scholar
[7]
[7]Villarreal, R., Cohen-Macaulay graphs, Manuscripta Math. 66 (1990), 277–293.Google Scholar