Matching numbers and the regularity of the Rees algebra of an edge ideal
classification
🧮 math.AC
keywords
matchingregularitynumberreesalgebraboundedgeideal
read the original 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.
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.