2019
DOI: 10.1080/00927872.2018.1527920
|View full text |Cite
|
Sign up to set email alerts
|

Associated primes of powers of cover ideals under graph operations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
4
1

Relationship

5
5

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…It has already been established in [15,Theorem 3.3] and [2, Theorem 1.10] that the cover ideals of odd cycle graphs are normal and have the (strong) persistence property. On the other hand, since any even cycle is a bipartite graph, its cover ideal is normally torsion-free, and so is normal and also has the (strong) persistence property.…”
Section: This Yields Thatmentioning
confidence: 99%
“…It has already been established in [15,Theorem 3.3] and [2, Theorem 1.10] that the cover ideals of odd cycle graphs are normal and have the (strong) persistence property. On the other hand, since any even cycle is a bipartite graph, its cover ideal is normally torsion-free, and so is normal and also has the (strong) persistence property.…”
Section: This Yields Thatmentioning
confidence: 99%
“…However, this behaviour changes when we consider the odd cycles. The cover ideals of odd cycles happen to be nearly normally torsion-free, see [15], but edge ideals of odd cycles do not admit such tamed behaviour for the set of their associated primes. Given these facts, it is natural to expect some irregularities for the closed neighborhood ideals and dominating ideals of even and odd cycles.…”
Section: On the Closed Neighborhood Ideals And Dominating Ideals Of C...mentioning
confidence: 99%
“…Ratliff [24] proved that (I k+1 : I) = I k for all large k. There are some interesting classes of monomial ideals satisfies in the strong persistence property. These include normal ideals, edge ideals of graphs, vertex cover ideals of perfect graphs (or chordal graphs), polymatroidal ideals, vertex cover ideals of cycle graphs of odd orders, vertex cover ideals of wheel graphs of even orders and all square-free monomial ideals in R with n ≤ 4, see for details [24,20,7,8,15,23,25,28].…”
Section: Introductionmentioning
confidence: 99%