Stanley depth of edge ideals
Abstract
We give an upper bound for the Stanley depth of the edge ideal I of a k-partite complete graph and show that Stanley's conjecture holds for I. Also we give an upper bound for the Stanley depth of the edge ideal of a k-uniform complete bipartite hypergraph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.