We survey known results on the existence and enumeration of many kinds of l-factorizations of the complete graph. We also mention briefly some related questions and topics. as well as applications.

A mitre in a Steiner triple system is a set of five triples on seven points, in which two are disjoint. Recursive constructions for Steiner triple systems containing no mitre are developed, leadingâ€¦ (More)

A collection of edge-disjoint triangle-factors on K3n is called maximal if it cannot be extended by a further triangle-factor. It is well-known that a maximal set must therefore contain at least %â€¦ (More)

A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the color classes. Inâ€¦ (More)