Projective dimension, graph domination parameters, and independence complex homology

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, we recover and strengthen existing results on the homological connectivity of graph independence complexes.