On the edge-colouring problem for unions of complete uniform hypergraphs

For given n@?N and H@?{1,2,...,n} we investigate whether the collection of subsets A@?{1,2,...,n} with |A|@?H possesses a parellelism (1-factorization). A complete solution for the case H={1,2,..., h} is given.