pith. sign in

arxiv: 0902.0902 · v3 · submitted 2009-02-05 · 🧮 math.AC · math.CO

Algebraic properties of the path ideal of a tree

classification 🧮 math.AC math.CO
keywords idealtreealgebraicgraphlengthpathpropertiesalways
0
0 comments X
read the original abstract

The path ideal (of length t >=2) of a graph G is the monomial ideal, denoted I_t(G), whose generators correspond to the directed paths of length t in G. We study some of the algebraic properties of I_t(G) when G is a tree. We first show that I_t(G) is the facet ideal of a simplicial tree. As a consequence, the quotient ring R/I_t(G) is always sequentially Cohen-Macaulay, and the Betti numbers of R/I_t(G) do not depend upon the characteristic of the field. We study the case of the line graph in greater detail at the end of the paper.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.