Regularity and Gr\"obner bases of the Rees algebra of edge ideals of bipartite graphs

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 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 match(G)+ E(G) +1 we prove that reg(Is+1)=reg(Is)+2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…