Stanley depth of edge ideals
From MaRDI portal
Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Abstract: We give an upper bound for the Stanley depth of the edge ideal of a -partite complete graph and show that Stanley's conjecture holds for . Also we give an upper bound for the Stanley depth of the edge ideal of a -uniform complete bipartite hypergraph.
Recommendations
- On the Stanley depth of edge ideals of k-partite clutters
- Upper and lower bounds for the Stanley depth of certain classes of monomial ideals and their residue class rings
- Depth and Stanley depth of edge ideals associated to some line graphs
- On the Stanley depth of powers of edge ideals
- Depth and Stanley depth of the edge ideals of the powers of paths and cycles
Cited in
(3)
This page was built for publication: Stanley depth of edge ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169215)