pith. sign in

arxiv: 1706.09002 · v1 · pith:KV44OJV4new · submitted 2017-06-27 · 🧮 math.AC · math.CO

Binomial edge ideals of regularity 3

classification 🧮 math.AC math.CO
keywords regularitybinomialedgegraphsidealscharacterizeformulaideal
0
0 comments X
read the original abstract

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.