Stanley depth of edge ideals
classification
🧮 math.AC
keywords
stanleydepthedgeboundcompletegiveidealupper
read the original 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.
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.