Regularity of parity binomial edge ideals

Abstract

Let $G$ be a simple graph on $n$ vertices and ${\mathcal{I}}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S=\mathbb{K}[x_1,\dots ,x_n,y_1,\dots ,y_n].$ We obtain a lower bound for the regularity of parity binomial edge ideals of graphs. We then classify all graphs whose parity binomial edge ideals have regularity $3$. We classify graphs whose parity binomial edge ideals have pure resolution.

10 pages, Suggestions and comments are welcome. arXiv admin note: text overlap with arXiv:1911.10388

Cited by in corpus (2)

• Regularity of powers of d-sequence (parity) binomial edge ideals of unicycle graphs
• (Almost) Complete Intersection Lovász-Saks-Schrijver ideals and regularity of their powers