论文标题
部分可观测时空混沌系统的无模型预测
Factorisation of the complete graph into spanning regular factors
论文作者
论文摘要
在几种情况下，我们将完整图的分解为跨越常规图的分解，包括当一个或两个因素的程度很小时。可以看到所得的渐近行为以简单的方式概括了常规图的数量。与顶点数量相比，当因素消失时，这使我们猜想了一般公式。
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.
