Binomial edge ideals of regularity $3$
Commutative Algebra
2017-06-29 v1 Combinatorics
Abstract
Let be the binomial edge ideal of a graph . We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity . Consequently we characterize all graphs such that is extremal Gorenstein. Indeed, these characterizations are consequences of an explicit formula we obtain for the regularity of the binomial edge ideal of the join product of two graphs. Finally, by using our regularity formula, we discuss some open problems in the literature. In particular we disprove a conjecture in \cite{CDI} on the regularity of weakly closed graphs.
Cite
@article{arxiv.1706.09002,
title = {Binomial edge ideals of regularity $3$},
author = {Sara Saeedi Madani and Dariush Kiani},
journal= {arXiv preprint arXiv:1706.09002},
year = {2017}
}
Comments
14 pages