Projective dimension, graph domination parameters, and independence complex homology

被引：25

作者：

Dao, Hailong ^{[1
]}

Schweig, Jay ^{[2
]}

机构：

[1] Univ Kansas, Dept Math, Lawrence, KS 66045 USA

[2] Oklahoma State Univ, Dept Math, Stillwater, OK 74078 USA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 2013年 / 120卷 / 02期

基金：

美国国家科学基金会;

关键词：

Projective dimension; Independence complex; Graph domination; Hochster's Formula; Edge ideal;

D O I：

10.1016/j.jcta.2012.09.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2012 Elsevier Inc. All rights reserved.

引用

页码：453 / 469

页数：17

共 30 条

[1] On a lower bound for the connectivity of the independence complex of a graph [J].