2000 character limit reached
Projective Dimension, Graph Domination Parameters, and Independence Complex Homology
Published 13 Oct 2011 in math.AC and math.CO | (1110.2841v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.