Regularity and Gr\"obner bases of the Rees algebra of edge ideals of bipartite graphs
classification
🧮 math.AC
math.CO
keywords
regularitytextalgebrabipartiteedgeobnerreesapply
read the original abstract
Let $G$ be a bipartite graph and $I=I(G)$ be its edge ideal. The aim of this note is to investigate different aspects of the Rees algebra $\mathcal{R}(I)$ of $I$. We compute its regularity and the universal Gr\"obner basis of its defining equations; interestingly, both of them are described in terms of the combinatorics of $G$. We apply these ideas to study the regularity of the powers of $I$. For any $s \ge \text{match}(G)+\lvert E(G) \rvert +1$ we prove that $\text{reg}(I^{s+1})=\text{reg}(I^s)+2$.
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.