REVIEW 1 cited by
Degree of $h$-polynomials of edge ideals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as paths, cycles, and bipartite graphs. To the best of our knowledge, this marks the first investigation into the combinatorial interpretation of this algebraic invariant. Additionally, we characterize all connected graphs in which the sum of the Castelnuovo-Mumford regularity and the degree of the $h$-polynomial of an edge ideal reaches its maximum value, which is the number of vertices in the graph.
Forward citations
Cited by 1 Pith paper
-
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 o...
Discussion (0). Sign in to comment.