Table of Contents
Fetching ...

Castelnuovo-Mumford regularity of the closed neighborhood ideal of a graph

Shiny Chakraborty, Ajay P. Joseph, Amit Roy, Anurag Singh

TL;DR

This work connects graph matching theory to the algebraic invariants of the closed neighborhood ideal $NI(G)$. It proves, for forests, that the Castelnuovo-Mumford regularity satisfies $\mathrm{reg}(R/NI(G))=a_G$, confirming a conjecture by Sharifan and Moradi, and establishes the universal lower bound $\mathrm{reg}(R/NI(G))\ge a_G$ for all graphs via topological methods. It further shows that if $G$ contains a simplicial vertex, $NI(G)$ admits a Betti splitting, yielding a lower bound $\mathrm{pd}(R/NI(G))\ge a_G$ in forests and unicyclic graphs, while the whisker construction yields explicit equalities $\mathrm{reg}(R'/NI(G'))=\mathrm{pd}(R'/NI(G'))=a_{G'}$. Together, these results illuminate how the combinatorial structure of $G$ governs the homological invariants of $NI(G)$, with sharp bounds and notable exceptions (e.g., certain chordal graphs) that motivate further study.

Abstract

Let $G$ be a finite simple graph and let $NI(G)$ denote the closed neighborhood ideal of $G$ in a polynomial ring $R$. We show that if $G$ is a forest, then the Castelnuovo-Mumford regularity of $R/NI(G)$ is the same as the matching number of $G$, thus proving a conjecture of Sharifan and Moradi in the affirmative. We also show that the matching number of $G$ provides a lower bound for the Castelnuovo-Mumford regularity of $R/NI(G)$ for any $G$. Furthermore, we prove that, if $G$ contains a simplicial vertex, then $NI(G)$ admits a Betti splitting, and consequently, we show that the projective dimension of $R/NI(G)$ is also bounded below by the matching number of $G$, if $G$ is a forest or a unicyclic graph.

Castelnuovo-Mumford regularity of the closed neighborhood ideal of a graph

TL;DR

This work connects graph matching theory to the algebraic invariants of the closed neighborhood ideal . It proves, for forests, that the Castelnuovo-Mumford regularity satisfies , confirming a conjecture by Sharifan and Moradi, and establishes the universal lower bound for all graphs via topological methods. It further shows that if contains a simplicial vertex, admits a Betti splitting, yielding a lower bound in forests and unicyclic graphs, while the whisker construction yields explicit equalities . Together, these results illuminate how the combinatorial structure of governs the homological invariants of , with sharp bounds and notable exceptions (e.g., certain chordal graphs) that motivate further study.

Abstract

Let be a finite simple graph and let denote the closed neighborhood ideal of in a polynomial ring . We show that if is a forest, then the Castelnuovo-Mumford regularity of is the same as the matching number of , thus proving a conjecture of Sharifan and Moradi in the affirmative. We also show that the matching number of provides a lower bound for the Castelnuovo-Mumford regularity of for any . Furthermore, we prove that, if contains a simplicial vertex, then admits a Betti splitting, and consequently, we show that the projective dimension of is also bounded below by the matching number of , if is a forest or a unicyclic graph.
Paper Structure (7 sections, 16 theorems, 30 equations, 1 figure)

This paper contains 7 sections, 16 theorems, 30 equations, 1 figure.

Key Result

Theorem 1.1

Let $G$ be a forest and let $\mathrm{reg}(R/NI(G))$ denote the Castelnuovo-Mumford regularity of $R/NI(G)$. Then, $\mathrm{reg}(R/NI(G))= a_G$, where $a_G$ denotes the matching number of $G$.

Figures (1)

  • Figure 1: A rooted tree $T$.

Theorems & Definitions (33)

  • Theorem 1.1
  • Theorem 1.2
  • Definition 2.1
  • Lemma 2.2
  • proof
  • Proposition 2.3
  • proof
  • Lemma 2.4
  • Theorem 2.5: Fröberg's theorem
  • Corollary 2.6
  • ...and 23 more