Search Results

You are looking at 1 - 1 of 1 items for

  • Author or Editor: Muhammad Ishaq x
  • All content x
Clear All Modify Search

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 s-uniform complete bipartite hypergraph.

Restricted access