Depth of edge ideals and vertex connectivity of finite graphs
arXiv:2605.04444
Abstract
Let be a finite graph on and its vertex connectivity. Let denote the polynomial ring in variables over a field and the edge ideal of the complementary graph of . It is a classical result that . We give a sharp lower bound of in terms of and . Furthermore, a sharp lower bound of as well as that of in terms of and is given.