All Questions

I am interested in a possible generalization of the following fact from combinatorics: If $n<m$ then there are at least as many ways to partition a set of size $nm$ into $m$ sets each of size $n$ ...