Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stanley depth of the path ideal associated to a line graph

Published 30 Aug 2015 in math.AC | (1508.07540v2)

Abstract: We consider the path ideal associated to a line graph, we compute \texttt{sdepth} for its quotient ring and note that it is equal with its \texttt{depth}. In particular, it satisfies the Stanley inequality.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up