Binomial edge ideals of bipartite graphs

From MaRDI portal
Publication:1746565

DOI10.1016/J.EJC.2017.11.004zbMATH Open1384.05094arXiv1704.00152OpenAlexW2962819683MaRDI QIDQ1746565FDOQ1746565


Authors: Davide Bolognini, Antonio Macchia, Francesco Strazzanti Edit this on Wikidata


Publication date: 25 April 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We classify the bipartite graphs G whose binomial edge ideal JG is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the converse of a well-known result due to Hartshorne, showing that the Cohen-Macaulayness of these ideals is equivalent to the connectedness of their dual graphs. We study interesting properties also for non-bipartite graphs and in the unmixed case, constructing classes of bipartite graphs with JG unmixed and not Cohen-Macaulay.


Full work available at URL: https://arxiv.org/abs/1704.00152




Recommendations




Cites Work


Cited In (46)

Uses Software





This page was built for publication: Binomial edge ideals of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746565)