2 problems

Let $G$ be an unmixed graph, meaning that all minimal vertex covers of $G$ have the same cardinality, and let $J(G)$ be its vertex cover ideal. Recall that a graph is vertex decomp…

Let $G$ be an unmixed vertex decomposable graph, and let $J(G)$ be its vertex cover ideal. Weak graph conjecture. Then … This is presented as a weak form of the conjecture for pure…