Upper bounds for the regularity of gap-free graphs in terms of minimal triangulation
Let \(\mathbb{K}\) be a field and \(R=\mathbb{K}[x_1,\ldots,x_n]\) be the polynomial ring in \(n\) variables over \(\mathbb{K}\). Suppose that \(M\) is a nonzero graded \(R\)-module with minimal free resolution \[0 \longrightarrow \cdots \longrightarrow \bigoplus_{j}R(-j)^{\beta_{1,j}(M)} \longrightarrow \bigoplus_{j}R(-j)^{\beta_{0,j}(M)} \longrightarrow M \longrightarrow 0.\] The Castelnuovo-Mumford regularity (or simply, regularity) of \(M\), denoted by \(\mathrm{reg}(M)\), is defined as \[\mathrm{reg}(M)=\max\{j-i\mid \beta _{i,j}(M)\neq 0\}.\] Let \(G\) be a finite simple graph with vertex set \(V(G)=\big\{x_1, \ldots, x_n\big\}\) and edge set \(E(G)\). The edge ideal \(I(G)\) of \(G\) defined by \[I(G)=\big(x_ix_j: \{x_i,x_j\}\in E(G)\big).\] Two disjoint edges \(e, e'\in E(G)\) are said to be a gap, if they form an induced subgraph of \(G\). The graph \(G\) is gap-free if it has no gap. In the paper under review, the authors provide an upper bound for the regularity of edge ideals of gap-free graphs, in terms of their minimal triangulation. It is shown that \(\mathrm{reg}(I(G))\leq \mathrm{reg}(I(\mathcal{C}_U))\), where \(\mathcal{C}_U\) is a \(3\)-uniform clutter which consists of certain \(3\)-paths in a minimal triangulation of \(G\). By using this result, a general upper bound for the regularity of gap-free graphs is studied. If \(\mathcal{H}\) is the \(3\)-uniform clutter which consists of certain \(3\)-cliques in \(G\) or in its triangulation and \(\mathcal{H}\) is chordal, then \(\mathrm{reg}(I(G))\leq 3\).
- Gap sets for the spectra of regular graphs with minimum spectral gap
- Upper bounds on the graph minor theorem
- An extremal problem motivated by triangle-free strongly regular graphs
- On regularity of upper bound graphs and double bound graphs
- scientific article; zbMATH DE number 1305094
- Some spectral inequalities for triangle-free regular graphs
- On the structure of triangle-free graphs of large minimum degree
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- scientific article; zbMATH DE number 2197896
- On the Gutman index and minimum degree of a triangle-free graph
- M-sequences, graph ideals, and ladder ideals of linear type
- A class of hypergraphs that generalizes chordal graphs
- Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Candidates for nonzero Betti numbers of monomial ideals
- Chordal and sequentially Cohen-Macaulay clutters
- Corrigendum to: ``Results on the regularity of square-free monomial ideals.
- scientific article; zbMATH DE number 16165 (Why is no real title available?)
- Improved bounds for the regularity of edge ideals of graphs
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Path ideals of rooted trees and their graded Betti numbers
- Powers of edge ideals with linear resolutions
- Powers of ideals associated to \((C_{4},2K_{2})\)-free graphs
- Regularity 3 in edge ideals associated to bipartite graphs
- Regularity of edge ideals and their powers
- Regularity of edge ideals of \(C_{4}\)-free graphs via the topology of the lcm-lattice
- Regularity of path ideals of gap free graphs
- Regularity of powers of edge ideals: from local properties to global bounds
- Regularity of powers of forests and cycles
- Regularity of squarefree monomial ideals
- Results on the regularity of square-free monomial ideals
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Stability of Betti numbers under reduction processes: towards chordality of clutters
- The regularity of powers of edge ideals
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
This page was built for publication: Upper bounds for the regularity of gap-free graphs in terms of minimal triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114466)
