arXiv · 1511.07310
The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Margherita Barile, Antonio Macchia. 2015-11-23. The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles. https://arxiv.org/abs/1511.07310
Cite the original work for its findings. Save a collection to share your selection of sources.