2000 character limit reached
Squarefree powers of edge ideals of forests
Published 20 May 2021 in math.AC and math.CO | (2105.09744v1)
Abstract: Let $I(G){[k]}$ denote the $k$th squarefree power of the edge ideal of $G$. When $G$ is a forest, we provide a sharp upper bound for the regularity of $I(G){[k]}$ in terms of the $k$-admissable matching number of $G$. For any positive integer $k$, we classify all forests $G$ such that $I(G){[k]}$ has linear resolution. We also give a combinatorial formula for the regularity of $I(G){[2]}$ for any forest $G$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.