中文
相关论文

相关论文: Regularity of binomial edge ideals of chordal grap…

200 篇论文

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

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 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

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

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

交换代数 · 数学 2013-11-19 Dariush Kiani , Sara Saeedi Madani

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

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

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

In this paper, we mainly study the Castelnuovo-Mumford regularity of the generalized binomial edge ideals of graphs. We show that this number can be any integer number from $2$ to $n-1$ where $n$ is the number of vertices in the underlying…

交换代数 · 数学 2026-01-06 Dariush Kiani , Sara Saeedi Madani , Guangjun Zhu

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

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of $I(G)^q$ in terms of certain combinatorial invariants associated with $G$. We…

交换代数 · 数学 2021-02-02 A. V. Jayanthan , S. Selvaraja

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

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 survey the recent results on the Castelnuovo-Mumford regularity of binomial edge ideals and generalized binomial edge ideals. We also generalize some of the known upper bounds for binomial edge ideals to the case of…

交换代数 · 数学 2025-08-19 A. V. Jayanthan , Arvind Kumar

Since the introduction of binomial edge ideals $J_{G}$ by Herzog et al. and independently Ohtani, there has been significant interest in relating algebraic invariants of the binomial edge ideal with combinatorial invariants of the…

交换代数 · 数学 2025-03-24 Adam LaClair

In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a…

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

For any two integers $d,r \geq 1$, we show that there exists an edge ideal $I(G)$ such that the ${\rm reg}\left(R/I(G)\right)$, the Castelnuovo-Mumford regularity of $R/I(G)$, is $r$, and ${\rm deg} (h_{R/I(G)}(t))$, the degree of the…

交换代数 · 数学 2018-10-17 Takayuki Hibi , Kazunori Matsuda , Adam Van Tuyl

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

In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph $G$, we define the invariant $\eta(G)$ as the maximum size of a clique disjoint edge set in $G$. We show that the regularity of the binomial…

交换代数 · 数学 2020-07-21 M. Rouzbahani Malayeri , S. Saeedi Madani , D. Kiani
‹ 上一页 1 2 3 10 下一页 ›