Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
DOI10.1090/S0002-9939-2014-12374-4zbMath1306.05036arXiv1301.2665OpenAlexW2100800722MaRDI QIDQ5496298
Publication date: 30 January 2015
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.2665
Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Syzygies, resolutions, complexes and commutative rings (13D02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45)
Related Items (12)
Cites Work
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Path ideals of rooted trees and their graded Betti numbers
- Chordal and sequentially Cohen-Macaulay clutters
- On rigid circuit graphs
- Extremal problems for transversals in graphs with bounded degree
- Algebraic properties of edge ideals via combinatorial topology
- \(M\)-sequences, graph ideals, and ladder ideals of linear type
- A tree version of Kőnig's theorem
- Projective dimension, graph domination parameters, and independence complex homology
- Local cohomology and pure morphisms
- Depths and Cohen-Macaulay properties of path ideals
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Algebraic Properties of the Path Ideal of a Tree
- Über lokale Kohomologiegruppen hoher Ordnung.
- Graded Betti numbers of path ideals of cycles and lines
- HYPERGRAPHS AND REGULARITY OF SQUARE-FREE MONOMIAL IDEALS
This page was built for publication: Bounding the projective dimension of a squarefree monomial ideal via domination in clutters