Projective Dimension, Graph Domination Parameters, and Independence Complex Homology
Commutative Algebra
2011-10-25 v2 Combinatorics
Abstract
We construct several pairwise-incomparable bounds on the projective dimensions of edge ideals. Our bounds use combinatorial properties of the associated graphs; in particular we draw heavily from the topic of dominating sets. Through Hochster's Formula, these bounds recover and strengthen existing results on the homological connectivity of graph independence complexes.
Cite
@article{arxiv.1110.2841,
title = {Projective Dimension, Graph Domination Parameters, and Independence Complex Homology},
author = {Hailong Dao and Jay Schweig},
journal= {arXiv preprint arXiv:1110.2841},
year = {2011}
}
Comments
Add references for Chapter 5 and 6. Add remarks 5.7 and 5.8