Weak and strong Lefschetz properties for vertex cover Artinian algebras associated to graphs

Abstract

Let $G$ be a finite simple graph and let $A_c(G)$ be the Artinian algebra associated with its cover ideal. We prove that $A_c(G)$ has the WLP when $\tau (G)>|V(G)|/2$, where $\tau (G)$ denotes the size of a minimum vertex cover of $G$. As a consequence, $A_c(G)$ has the WLP with high probability when the Erdős-Rényi random graph model is considered. Moreover, we study the borderline case $\tau (G)=|V(G)|/2$ and as a result, classify the WLP for paths, cycles, Ferrers graphs, and well-covered trees.

arXiv commentare welcome! 23 pages