Resolution of Unmixed Bipartite Graphs

2009/01/20 by Fatemeh Mohammadi, Mohammadi, Fatemeh, Somayeh Moradi +1 · 1 citation
Mathematics · #Commutative Algebra and Its Applications #Advanced Combinatorial Mathematics #Algebraic Geometry and Number Theory

paper · pdf · doi:10.48550/arxiv.0901.3015

Abstract

For an unmixed bipartite graph G we consider the lattice of vertex covers L_G and compute depth, projective dimension and extremal Betti-numbers of R/I(G) in terms of this lattice.

Cited by

• The Exponential Hyper-Zagreb Indices and Structural Properties of Trees and Bipartite Graphs

Related

• Resolution and Betti numbers of Vertex cover ideals
• Max Min vertex cover and the size of Betti tables
• Algebraic and geometric aspects of bipartite planar graphs
• The lattice dimension of a graph
• Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs