Projective dimension, graph domination parameters, and independence complex homology
Projective dimension, graph domination parameters, and independence complex homology
复制标题
投影维数、图支配参数和独立复数同调性
DOI:
10.1016/j.jcta.2012.09.005
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
Jay Schweig
中科院分区:
文献类型:
--
作者:
Hailong Dao;Jay Schweig
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.