Let X,Y be finite sets, r,s,h,??N with s?r,X?Y. By ?Xh we mean the collection of all h-subsets X where each subset occurs ? times. A coloring (partition) is r-regular if element in exactly r subsets color. one-regular color class a perfect matching. We are interested necessary and sufficient conditions under which an can embedded into s-regular ?Yh. Using algebraic techniques involving glueing ...