Induced Matchings and the v-Number of Graded Ideals

@article{Grisalde2021InducedMA,
  title={Induced Matchings and the v-Number of Graded Ideals},
  author={Gonzalo Grisalde and Enrique Reyes and Rafael H. Villarreal},
  journal={Mathematics},
  year={2021}
}
We give a formula for the v-number of a graded ideal that can be used to compute this number. Then, we show that for the edge ideal I(G) of a graph G, the induced matching number of G is an upper bound for the v-number of I(G) when G is very well-covered, or G has a simplicial partition, or G is well-covered connected and contains neither four, nor five cycles. In all these cases, the v-number of I(G) is a lower bound for the regularity of the edge ring of G. We classify when the induced… 
2 Citations

Figures from this paper

The $\mathrm{v}$-number of Monomial Ideals
We generalize some results of v-number for arbitrary monomial ideals by showing that the v-number of an arbitrary monomial ideal is the same as the v-number of its polarization. We prove that the
Colon structure of associated primes of monomial ideals
We find an explicit expression of the associated primes of monomial ideals as a colon.

References

SHOWING 1-10 OF 60 REFERENCES
Associated primes of monomial ideals and odd holes in graphs
Let G be a finite simple graph with edge ideal I(G). Let I(G)∨ denote the Alexander dual of I(G). We show that a description of all induced cycles of odd length in G is encoded in the associated
A characterization of well-covered graphs that contain neither 4- nor 5-cycles
TLDR
If G is a connected, well-covered graph containing no 4- nor 5-cycles as subgraphs and G contains an extendable vertex, then G is the disjoint union of edges and triangles together with a restricted set of edges joining extendable vertices.
On well-covered graphs of odd girth 7 or greater
TLDR
It is proved that every connected member G of Gγ=α containing neither C3 nor C5 as a subgraph is a K1, C4, C7 or a corona graph.
A class of planar well-covered graphs with girth four
TLDR
It is shown that all planar 1-well-covered graphs of girth 4 belong to a specific infinite family, and a characterization of this family is given.
Dominating induced matchings of finite graphs and regularity of edge ideals
The regularity of the edge ideal of a finite simple graph G is at least the induced matching number of G and is at most the minimum matching number of G. If G possesses a dominating induced matching,
A Characterization of Well Covered Graphs of Girth 5 or Greater
TLDR
If G is a connected, well covered graph of girth ≥ 5 and G contains an extendable vertex then G is the disjoint union of edges and 5-cycles together with a restricted set of edges joining these subgraphs.
...
1
2
3
4
5
...