The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles
classification
🧮 math.AC
math.CO
keywords
cyclesarithmeticaledgepairwiserankaboveassociatedbounded
read the original abstract
We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.
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.