The binomial edge ideal of a pair of graphs

From MaRDI portal
Publication:5408693

DOI10.1215/00277630-2389872zbMATH Open1298.13020arXiv1203.2775OpenAlexW3099478537MaRDI QIDQ5408693FDOQ5408693


Authors: Viviana Ene, Jürgen Herzog, Takayuki Hibi, Ayesha Asloob Qureshi Edit this on Wikidata


Publication date: 11 April 2014

Published in: Nagoya Mathematical Journal (Search for Journal in Brave)

Abstract: We introduce a class of ideals generated by a set of 2-minors of mimesn-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by adjacent minors. We determine the minimal prime ideals of such ideals and give a lower bound for their degree of nilpotency. In some special cases we compute their Gr"obner basis and characterize unmixedness and Cohen--Macaulayness.


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




Recommendations




Cites Work


Cited In (24)





This page was built for publication: The binomial edge ideal of a pair of graphs

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