Projective dimension, graph domination parameters, and independence complex homology

DOI10.1016/J.JCTA.2012.09.005MaRDI QIDQ1930143zbMATH OpenOpenAlexFDO

Authors Hailong Dao, Jay Schweig

Publication date 10 January 2013

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.2841

zbMATH Keywords

edge idealgraph dominationHochster's formulaindependence complexprojective dimension

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Group actions on combinatorial structures (05E18)

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.

Recommendations

• Further applications of clutter domination parameters to projective dimension
• Domination numbers and homology
• Projective dimension and symmetric algebra of graph ideals
• Bounds on the regularity and projective dimension of ideals associated to graphs
• Regularity and projective dimension of edge ideals

Cited in

(35)

• On Betti numbers of edge ideals of crown graphs
• Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
• Projective dimension of hypergraphs
• Initially regular sequences and depths of ideals
• Noncover complexes, independence complexes, and domination numbers of hypergraphs
• Domination numbers and noncover complexes of hypergraphs
• Collapsibility of non-cover complexes of graphs
• Further applications of clutter domination parameters to projective dimension
• A note on independence complexes of chordal graphs and dismantling
• \textsc{MAX MIN} vertex cover and the size of Betti tables
• Nonvanishing of Betti numbers of edge ideals and complete bipartite subgraphs
• Bounds on the regularity and projective dimension of ideals associated to graphs
• Hypergraphs with high projective dimension and 1-dimensional hypergraphs
• Regularity and projective dimension of edge ideals
• Algebraic study on Cameron-Walker graphs
• Projective dimension and symmetric algebra of graph ideals
• Homological invariants of Cameron-Walker graphs
• The size of Betti tables of edge ideals arising from bipartite graphs
• On the homology of independence complexes
• G-quadratic, LG-quadratic, and Koszul quotients of exterior algebras
• Depth of powers of squarefree monomial ideals (research)
• Betti numbers of edge ideals of some split graphs
• Regularity and projective dimension of the edge ideal of C₅-free vertex decomposable graphs
• Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
• Bouquets, vertex covers and edge ideals
• Certain homological invariants of bipartite Kneser graphs
• Projective Dimension of Some Graphs
• Shedding vertices and ass-decomposable monomial ideals
• Graded Betti numbers of some bipartite graphs
• Depth and singular varieties of exterior edge ideals
• Degree of h-polynomials of edge ideals
• Homological invariants of edge ideals of Wollastonite graphs
• Certain homological invariants of some bipartite graphs
• Homological invariants of some complete split-like graphs
• A lower bound for depths of powers of edge ideals

This page was built for publication: Projective dimension, graph domination parameters, and independence complex homology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930143)