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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.