text: abstract
  we give upper bounds for the stanley depth of edge ideals of certain k–
  partite clutters. in particular, we generalize a result of ishaq about the
  stanley depth of the edge ideal of a complete bipartite graph. a result of
  pournaki, seyed fakhari and yassemi implies that the stanley’s conjecture
  holds for d-uniform complete d-partite clutters. here we give a shorter and
  different proof of this fact.