Symbolic powers of certain cover ideals of graphs

From MaRDI portal
Publication:2048963



Abstract: In this paper, we compute the regularity and Hilbert series of symbolic powers of the cover ideal of a graph G when G is either a crown graph or a complete multipartite graph. We also compute the multiplicity of symbolic powers of cover ideals in terms of the number of edges.


Let \(S=\mathbb{K}[x_1,\ldots,x_n]\) be the polynomial ring in \(n\) variables over a field \(\mathbb{K}\). To every simple graph \(G\) with vertex set \(V(G)=\{x_1, \ldots, x_n\}\) and edge set \(E(G)\), one associates its edge ideal \(I=I(G)\) defined by \[I(G)=\big(x_ix_j: \{x_i,x_j\}\in E(G)\big)\subseteq S.\]The Alexander dual of edge ideals, namely the ideal\[J(G)=\bigcap_{\{x_i, x_j\}\in E(G)}(x_i, x_j),\] is called the cover ideal of \(G\). One can easily check that\[J(G)=\big(\prod_{x_i\in C}x_i \mid C \text{ is a minimal vertex cover of } G\big),\]and this equality clarifies the reason of naming the cover ideals. In the paper under review, the authors compute the regularity and Hilbert series of symbolic powers of cover ideal of a graph \(G\) when \(G\) is either a crown graph or a complete multipartite graph. They also compute the multiplicity of symbolic powers of cover ideals in terms of the number of edges.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Symbolic powers of certain cover ideals of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048963)