The edge ideal of a graph and its splitting graphs (Q2154973): Difference between revisions

Let \(G\) be a simple graph. The authors define a \textit{splitting graph} of \(G\) as any graph \(G'\) for which there exists a surjective map \(V(G') \to V(G)\) inducing a bijective map of the edge sets of \(G'\) and \(G\). In the main result of this article, under extra assumptions on \(G'\), the authors show that \[ \operatorname{proj\; dim} I(G) \leq \operatorname{proj\; dim} I(G')\quad \text{and}\quad \operatorname{reg} I(G) \leq \operatorname{reg} I(G'), \] where \(I(G)\) and \(I(G')\) are the edge ideals of \(G\) and \(G'\), respectively (Theorem 1.3). In Propositions 1.5 and 1.6, the authors give conditions on \(G\) for these inequalities to hold, for any splitting graph \(G'\).