THE PROJECTIVE DIMENSION OF THE EDGE IDEAL OF A VERY WELL-COVERED GRAPH
KYOUKO KIMURA, NAOKI TERAI, SIAMAK YASSEMI
Source abstract
A very well-covered graph is an unmixed graph whose covering number is half of the number of vertices. We construct an explicit minimal free resolution of the cover ideal of a Cohen–Macaulay very well-covered graph. Using this resolution, we characterize the projective dimension of the edge ideal of a very well-covered graph in terms of a pairwise -disjoint set of complete bipartite subgraphs of the graph. We also show nondecreasing property of the projective dimension of symbolic powers of the edge ideal of a very well-covered graph with respect to the exponents.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.