k-neighborhood ideals of graphs
Abstract
In this paper, we introduce and investigate the k-neighborhood ideal of a graph, a natural generalization of the closed neighborhood ideal. Let G be a simple graph on the vertex set [n], and let S=K[x1,…,xn] be the polynomial ring over a field K. For a vector k=(k1,…,kn)∈ Nn satisfying 1≤ ki≤ degG(i)+1 for all i, the k-neighborhood ideal of G is defined as the squarefree monomial ideal NIk(G)=Σi=1n\, (xW:\, W⊂eq NG[i],\, |W|=ki) of S, where xW=Πi∈ W xi. We study homological invariants and properties of NIk(G) focusing on its Castelnuovo-Mumford regularity, projective dimension and Cohen-Macaulayness. Special attention is devoted to the case where the vector k is the degree-vector of the graph, i.e., ki=degG(i) for all vertices i, and to the case where NIk(G) coincides with the edge ideal of a graph. In these settings, we provide combinatorial characterizations and bounds for the regularity and projective dimension of NIk(G) for several classes of graphs, and further investigate the Cohen-Macaulay property of these ideals.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.