Resolution of unmixed bipartite graphs
Mohammadi, Fatemeh
Moradi, Somayeh
Let G be a graph on the vertex set V(G) = {x1,…,xn} with the edge set E(G), and let R = K[x1,…, xn] be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials xixj with {xi,xj} ∈ E(G), and the vertex cover ideal IG generated by monomials ∏xi∈Cxi for all minimal vertex covers C of G. A minimal vertex cover of G is a subset C ⊂ V(G) such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers LG and we explicitly describe the minimal free resolution of the ideal associated to LG which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.
Korean Mathematical Society
2015
info:eu-repo/semantics/article
doc-type:article
text
http://purl.org/coar/resource_type/c_6501
https://research-explorer.app.ist.ac.at/record/1547
Mohammadi F, Moradi S. Resolution of unmixed bipartite graphs. <i>Bulletin of the Korean Mathematical Society</i>. 2015;52(3):977-986. doi:<a href="https://doi.org/10.4134/BKMS.2015.52.3.977">10.4134/BKMS.2015.52.3.977</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.4134/BKMS.2015.52.3.977
info:eu-repo/semantics/altIdentifier/issn/2234-3016
info:eu-repo/semantics/openAccess