The v-number bound for closed neighborhood ideals

Let GG be a simple connected graph, let SS be the polynomial ring associated with GG, and let mathttv(NG)mathtt{v}(\mathcal{N}_G) denote the v\mathtt{v}-number of its closed neighborhood ideal NG\mathcal{N}_G. Let reg(S/NG)\mathtt{reg}(S/\mathcal{N}_G) denote the Castelnuovo–Mumford regularity of the quotient.

The v-number bound. For every simple connected graph GG,

v(NG)reg(S/NG).\mathtt{v}(\mathcal{N}_G)\leq \mathtt{reg}(S/\mathcal{N}_G).

The preceding theorem establishes this inequality for bipartite, very well-covered, and chordal graphs, and in particular for trees. The conjecture extends that phenomenon to all simple connected graphs; its general status is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Delio Jaramillo-Velez, Hiram H. López and Rodrigo San-José, “Private neighbors, perfect codes and their relation with the v-number of closed neighborhood ideals”, arXiv:2603.28247 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.