Matching numbers and the regularity of the Rees algebra of an edge ideal
Abstract
The regularity of the Rees ring of the edge ideal of a finite simple graph is studied. We show that the matching number is a lower and matching number~+1 is an upper bound of the regularity, if the Rees algebra is normal. In general the induced matching number is a lower bound for the regularity, which can be shown by applying the squarefree divisor complex.
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.