For edge ideals of connected graphs, the v-number can be arbitrarily larger or smaller than the degree of the h-polynomial, their sum is at most the number of vertices, and equality holds exactly for disjoint unions of star graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Comparing the $\mathrm{v}$-number and $h$-polynomials of edge ideals
For edge ideals of connected graphs, the v-number can be arbitrarily larger or smaller than the degree of the h-polynomial, their sum is at most the number of vertices, and equality holds exactly for disjoint unions of star graphs.