English

Depth of edge ideals and vertex connectivity of finite graphs

Commutative Algebra 2026-05-07 v1 Combinatorics

Abstract

Let GG be a finite graph on [n]:={1,,n}[n]:=\{1, \ldots, n\} and κ(G)\kappa(G) its vertex connectivity. Let S=K[x1,,xn]S=K[x_1, \ldots, x_n] denote the polynomial ring in nn variables over a field KK and I(Gc)I(G^c) the edge ideal of the complementary graph GcG^c of GG. It is a classical result that depthS/I(Gc)κ(G)+1{\rm depth} S/I(G^c) \leq \kappa(G) + 1. We give a sharp lower bound of depthS/I(Gc){\rm depth} S/I(G^c) in terms of nn and κ(G)\kappa(G). Furthermore, a sharp lower bound of depthS/I(Gc)2{\rm depth} S/I(G^c)^2 as well as that of depthS/I(Gc)(2){\rm depth} S/I(G^c)^{(2)} in terms of nn and κ(G)\kappa(G) is given.

Keywords

Cite

@article{arxiv.2605.04444,
  title  = {Depth of edge ideals and vertex connectivity of finite graphs},
  author = {Takayuki Hibi and Seyed Amin Seyed Fakhari},
  journal= {arXiv preprint arXiv:2605.04444},
  year   = {2026}
}