arXiv · 1110.2841
Projective Dimension, Graph Domination Parameters, and Independence Complex Homology
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.
Explore related subjects
Keep this discovery
Hailong Dao, Jay Schweig. 2011-10-22. Projective Dimension, Graph Domination Parameters, and Independence Complex Homology. https://arxiv.org/abs/1110.2841
Cite the original work for its findings. Save a collection to share your selection of sources.