  We enumerate factorisations of the complete graph into spanning regular
graphs in several cases, including when the degrees of all the factors except
for one or two are small. The resulting asymptotic behaviour is seen to
generalise the number of regular graphs in a simple way. This leads us to
conjecture a general formula when the number of factors is vanishing compared
to the number of vertices.
