Resolvable

A balanced incomplete Block Design $(B,V)$ is called resolvable if there exists a Partition $R$ of its set of blocks $B$ into Parallel Classes, each of which in turn partitions the set $V$. The partition $R$ is called a Resolution.

See also Block Design, Parallel Class

References

Abel, R. J. R. and Furino, S. C. ``Resolvable and Near Resolvable Designs.'' §I.6 in The CRC Handbook of Combinatorial Designs (Ed. C. J. Colbourn and J. H. Dinitz). Boca Raton, FL: CRC Press, pp. 4 and 87-94, 1996.