The statement of the result is that if <math>2\le r<k</math> are integers and r divides k, then the complete hypergraph <math>K^k_r</math> decomposes into 1-factors. <math>K^k_r</math> is a hypergraph with k vertices, in which every subset of r vertices forms a hyperedge; a 1-factor of this hypergraph is a set of hyperedges that touches each vertex exactly once, or equivalently a partition of the vertices into subsets of size r. Thus, the theorem states that the k vertices of the hypergraph may be partitioned into subsets of r vertices in <math>\binom{k}{r}\frac{r}{k} = \binom{k-1}{r-1}</math> different ways, in such a way that each r-element subset appears in exactly one of the partitions.
The case <math>r = 2</math>
In the special case <math>r = 2</math>, we have a complete graph <math>K_n</math> on <math>n</math> vertices, and we wish to color the edges with <math>\binom{n}{2}\frac{2}{n} = n-1 </math> colors so that the edges of each color form a perfect matching. Baranyai's theorem says that we can do this whenever <math>n</math> is even.
History
The r = 2 case can be rephrased as stating that every complete graph with an even number of vertices has an edge coloring whose number of colors equals its degree, or equivalently that its edges may be partitioned into perfect matchings. It may be used to schedule round-robin tournaments, and its solution was already known in the 19th century. The case that k = 2r is also easy.
The r = 3 case was established by R. Peltesohn in 1936. The general case was proved by Zsolt Baranyai in 1975.
