Regularity bound of generalized binomial edge ideal of graphs

DOI10.1016/J.JALGEBRA.2019.10.051MaRDI QIDQ2285293zbMATH OpenOpenAlexWikidataFDO

Publication date 8 January 2020

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgebra.2019.10.051

Castelnuovo-Mumford regularity chordal graph generalized binomial edge ideal of graphs

Combinatorial aspects of commutative algebra (05E40) Other special types of modules and ideals in commutative rings (13C13) Syzygies, resolutions, complexes and commutative rings (13D02)

Review text

Let \(\mathbb{K}\) be a field and \(S=\mathbb{K}[x_{i,j} : i\in [m], j\in [n]]\) be the polynomial ring in \(mn\) variables over \(\mathbb{K}\). Also, let \(\mathcal{G}_1\) and \(\mathcal{G}_2\) be graphs on the vertex set \([m]\) and \([n]\), respectively. To any pair of edges \(e=\{i, j\}\in E(\mathcal{G}_1)\) and \(e'=\{k, l\}\in E(\mathcal{G}_2)\), one associates the binomial \(p_{e,e'}=x_{i,k}x_{j,l}-x_{i,l}x_{j,k}\). The binomial edge ideal of the pair \((\mathcal{G}_1, \mathcal{G}_2)\) is defined as \[\mathcal{J}_{\mathcal{G}_1, \mathcal{G}_2}=(p_{e,e'} : e\in E(\mathcal{G}_1), e'\in E(\mathcal{G}_2)).\] In the paper under review, the author considers the case that \(\mathcal{G}_1=K_m\) (\(m\geq 2\)) is a complete graph. As the first result of this paper, it is proven that for any connected graph \(\mathcal{G}\) on \([n]\), \(\mathrm{ reg}(S/\mathcal{J}_{K_m, \mathcal{G}})\leq n-1\), with equality if \(m\geq n\geq 2\). As a consequence, it is shown for every connected graph \(\mathcal{G}\) on \([n]\) with \(m<n\), we have \(\mathrm{ reg}(S/\mathcal{J}_{K_m, \mathcal{G}})\geq \max\{m-1, l(\mathcal{G})\}\), where \(l(\mathcal{G})\) denotes the length of longest induced path in \(\mathcal{G}\). Moreover, it is proved that if \(\mathcal{G}\) is a connected graph on \([n]\) with clique number \(\omega(\mathcal{G})\), such that \(m\leq \omega(\mathcal{G})-1\), then \(\mathrm{ reg}(S/\mathcal{J}_{K_m, \mathcal{G}})\leq n-2\). Let \(e(\mathcal{G})\) be the number of edges of \(\mathcal{G}\) and let \(c(\mathcal{G})\) denote the number of maximal cliques of \(\mathcal{G}\). In [Electron. J. Comb. 20, No. 1, Research Paper P48, 13 p. (2013; Zbl 1278.13007)], \textit{S. S. Madani} and \textit{D. Kiani} conjectured that for any graph \(\mathcal{G}\) on \([n]\), the inequality \(\mathrm{reg}(S/\mathcal{J}_{K_m, \mathcal{G}}) \leq \min\left\{\binom{m}{2}c(\mathcal{G}), e(\mathcal{G})\right\}\) holds. Recently in [``Regularity of binomial edge ideals of chordal graphs, Preprint, \url{arXiv:1810.03119}], \textit{M. Rouzbahani Malayeri} et al. proved the conjecture when \(m=2\) and \(\mathcal{G}\) is a chordal graph. In the paper under review, the conjecture is proved when \(m\geq 2\) is an arbitrary integer and \(\mathcal{G}\) is a chordal graph. More precisely, it is shown that for any connected chordal graph \(\mathcal{G}\), the inequality \(\mathrm{ reg}(S/\mathcal{J}_{K_m, \mathcal{G}}) \leq (m-1)c(\mathcal{G})\) holds.

Recommendations

Cites work

Cited in

(20)

Describes a project that uses

Uses Software

This page was built for publication: Regularity bound of generalized binomial edge ideal of graphs

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