arXiv · 2011.08497
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,\ldots, x_n, y_1, \ldots, 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.
Explore related subjects
Keep this discovery
Arvind Kumar. 2020-11-17. Regularity of parity binomial edge ideals. https://doi.org/10.1090/proc/15434
Cite the original work for its findings. Save a collection to share your selection of sources.