中文
相关论文

相关论文: Upper bounds for the regularity of powers of edge …

200 篇论文

We survey recent studies on the Castelnuovo-Mumford regularity of edge ideals of graphs and their powers. Our focus is on bounds and exact values of $\text{reg} I(G)$ and the asymptotic linear function $\text{reg} I(G)^q$, for $q \geq 1,$…

交换代数 · 数学 2022-09-28 Arindam Banerjee , Selvi Kara , Huy Tai Ha

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of symbolic powers of certain…

交换代数 · 数学 2021-08-20 Arvind Kumar , S Selvaraja

In this article, we obtain an upper bound for the Castelnuovo-Mumford regularity of powers of an ideal generated by a homogeneous quadratic sequence in a polynomial ring in terms of the regularity of its related ideals and degrees of its…

交换代数 · 数学 2020-10-22 A. V. Jayanthan , Arvind Kumar , Rajib Sarkar

We show that the co-chordal cover number of a graph G gives an upper bound for the Castelnuovo-Mumford regularity of the associated edge ideal. Several known combinatorial upper bounds of regularity for edge ideals are then easy…

组合数学 · 数学 2014-09-10 Russ Woodroofe

Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subseteq J$. In this paper, we obtain a general upper and lower bound for the Castelnuovo-Mumford regularity of $IJ$ in terms of certain…

交换代数 · 数学 2022-09-13 Arindam Banerjee , Priya Das , S. Selvaraja

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

交换代数 · 数学 2018-10-16 Jürgen Herzog , Takayuki Hibi

We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\mathrm{reg}(J_G)\leq n-1$ for any graph $G$ with $n$ vertices, which is not a…

交换代数 · 数学 2015-04-08 Dariush Kiani , Sara Saeedi Madani

In this paper, we prove the upper bound conjecture proposed by Saeedi Madani \& Kiani on the Castelnuovo-Mumford regularity of generalized binomial edge ideals. We give a combinatorial upper bound of regularity for generalized binomial edge…

交换代数 · 数学 2025-12-02 Anuvinda J , Ranjana Mehta , Kamalesh Saha

In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the…

交换代数 · 数学 2018-10-09 M. Rouzbahani Malayeri , S. Saeedi Madani , D. Kiani

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

交换代数 · 数学 2020-08-04 Arvind Kumar , Rajiv Kumar , Rajib Sarkar

We study the Castelnuovo-Mumford regularity of powers of edge ideals. We prove that if G is a bipartite graph, then reg(I(G)^s) \leq 2s + reg I(G) - 2 for all s \geq 2, which is the best possible upper bound for any s. Suspension plays a…

交换代数 · 数学 2019-09-06 Arindam Banerjee , Eran Nevo

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph…

交换代数 · 数学 2016-01-05 Somayeh Moradi , Dariush Kiani

Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1,\ldots, y_n].$ We prove that the Castelnuovo-Mumford regularity of $J_G$ is bounded above by $c(G)+1$ when $G$…

组合数学 · 数学 2021-08-20 Arvind Kumar

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

交换代数 · 数学 2016-05-24 Jennifer Biermann , Augustine O'Keefe , Adam Van Tuyl

We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with $n$ vertices the maximum regularity grows as $2n/3$. We also bound the regularity by graph theoretic…

交换代数 · 数学 2021-03-11 Thomas Kahle , Jonas Krüsemann

In this article, we prove that for several classes of graphs, the Castelnuovo-Mumford regularity of symbolic powers of their edge ideals coincide with that of their ordinary powers.

交换代数 · 数学 2019-12-17 A. V. Jayanthan , Rajiv Kumar

We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.

交换代数 · 数学 2012-08-14 Kazunori Matsuda , Satoshi Murai

We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by $m(G)+1$, where…

交换代数 · 数学 2021-12-07 Arvind Kumar

We compute the Castelnuovo-Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and…

交换代数 · 数学 2019-07-24 Miguel Eduardo Uribe-Paczka , Adam Van Tuyl

Let $I(G)$ be the edge ideal of a bicyclic graph. In this paper, we characterize the Castelnuovo-Mumford regularity of $I(G)$ in terms of the induced matching number of $G$. For the base case of this family of graphs, i.e. dumbbell graph,…

交换代数 · 数学 2018-10-18 Yairon Cid-Ruiz , Sepehr Jafari , Navid Nemati , Beatrice Picone
‹ 上一页 1 2 3 10 下一页 ›