Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs
Let \(G\) denote a simple graph on the vertex set \(\{x_1,\ldots,x_n\}\) with edge set \(E(G)\). The edge ideal \(I(G)\) in the polynomial ring \(R = k[x_1,\ldots,x_n]\) over the field \(k\) is defined by \(I(G) = (x_ix_j : \{x_i,x_j\} \in E(G))\). The authors' intention is to describe the Castelnuovo-Mumford regularity \(\text{reg} R/I(G)\) in terms of combinatorial data of the graph \(G\). Let \(a'(G)\) denote the maximum number of vertex disjoint paths of length at most two in \(G\) such that paths of lengths one are pairwise \(3\)-disjoint in \(G\). Another integer defined by the authors and related to \(G\) is \(n(G)\). Then it is shown: (1) \(\text{reg} R/I(G) \leq \max \{a'(G), n(G)\}\) for \(G\) a vertex decomposable graph \(G\). (2) \(\text{reg} R/I(G) \leq n(G)\) for \(G\) a shellable graph.
- Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
- The regularity of edge ideals of graphs
- Upper bounds for the regularity of powers of edge ideals of graphs
- Bounds for the regularity of product of edge ideals
- Bounds on regularity of quadratic monomial ideals
- Regularity of path ideals of gap free graphs
- Results on the regularity of square-free monomial ideals
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Regularity and projective dimension of edge ideals
- Regularity of bicyclic graphs and their powers
- Regularity and projective dimension of the edge ideal of C₅-free vertex decomposable graphs
- scientific article; zbMATH DE number 7660842 (Why is no real title available?)
- Solution to a conjecture on edge rings with 2-linear resolutions
- Shedding vertices and ass-decomposable monomial ideals
This page was built for publication: Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553449)