The Betti numbers of forests
arXiv:math/0501226
Abstract
This paper produces a recursive formula of the Betti numbers of certain Stanley-Reisner ideals (graph ideals associated to forests). This gives a purely combinatorial definition of the projective dimension of these ideals, which turns out to be a new numerical invariant of forests. Finally, we propose a possible extension of this invariant to general graphs.
12 pages
References in corpus (1)
Cited by in corpus (16)
- Splittings of Toric Ideals
- Whiskers and sequentially Cohen-Macaulay graphs
- Algebraic properties of the path ideal of a tree
- Regularity of binomial edge ideals of chordal graphs
- Combinatorial symbolic powers
- Algebraic properties of edge ideals via combinatorial topology
- On the arithmetical rank of the edge ideals of forests
- Associated primes of monomial ideals and odd holes in graphs
- Splittable ideals and the resolutions of monomial ideals
- On the linear strand of an edge ideal
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Discrete Polymatroids satisfying a stronger symmetric exchange property
- Non-vanishing of Betti numbers of edge ideals and complete bipartite subgraphs
- Projective dimensions of the edge ideals of forests
- Characteristic-independence of Betti numbers of graph ideals
- Arithmetical rank of the cyclic and bicyclic graphs