Article contents
The binomial edge ideal of a pair of graphs
Published online by Cambridge University Press: 11 January 2016
Abstract
We introduce a class of ideals generated by a set of 2-minors of an (m × n)-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öbner basis and characterize unmixedness and Cohen–Macaulayness.
- Type
- Research Article
- Information
- Copyright
- Copyright © Editorial Board of Nagoya Mathematical Journal 2014
References
- 9
- Cited by