Sharp lower bounds for depth(S/I(G^c)), depth(S/I(G^c)^2), and depth(S/I(G^c)^{(2)}) are established in terms of n and κ(G).
Monomial Ideals,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Depth of edge ideals and vertex connectivity of finite graphs
Sharp lower bounds for depth(S/I(G^c)), depth(S/I(G^c)^2), and depth(S/I(G^c)^{(2)}) are established in terms of n and κ(G).