Advanced Search

For each squarefree monomial ideal $I\subset S=k[x_1,...,x_n]$, we associate a simple finite graph $G_I$ by using the first linear syzygies of $I$. The nodes of $G_I$ are the generators of $I$, and two vertices $u_i$ and $u_j$ are adjacent if there exist variables $x,y$ such that $x{u}_i=y{u}_j$. In the cases, where $G_I$ is a cycle or a tree, we show that $I$ has a linear resolution if and only if $I$ has linear quotients and if and only if $I$ is variable-decomposable. In addition, with the same assumption on $G_I$, we characterize all squarefree monomial ideals with a...