Regularity of parity binomial edge ideals

From MaRDI portal



Abstract: Let G be a simple graph on n vertices and mathcalIG denotes parity binomial edge ideal of G in the polynomial ring S=mathbbK[x1,ldots,xn,y1,ldots,yn]. 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.











This page was built for publication: Regularity of parity binomial edge ideals

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