Resumen de Powers of the vertex cover ideals
We describe a combinatorial condition on a graph which guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated by Eagon and Reiner’s Theorem we study whether all powers of the vertex cover ideal of a Cohen-Macaulay graph have linear free resolutions. After giving a complete characterization of Cohen-Macaulay cactus graphs (i.e., connected graphs in which each edge belongs to at most one cycle) we show that all powers of their vertex cover ideals have linear resolutions.
