Resolution of Unmixed Bipartite Graphs
classification
🧮 math.AC
math.CO
keywords
bipartitelatticeunmixedbetti-numberscomputeconsidercoversdepth
read the original abstract
For an unmixed bipartite graph $G$ we consider the lattice of vertex covers $\mathcal{L}_G$ and compute depth, projective dimension and extremal Betti-numbers of $R/I(G)$ in terms of this lattice.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.