论文标题
普遍的Oberwolfach问题
The generalised Oberwolfach problem
论文作者
论文摘要
我们证明，所有度相等的quasirandom密集大图，甚至可以分解为任何给定的两因素集合（2个2个跨性别子图）。此结果的特殊情况为Oberwolfach问题提供了新的解决方案。
We prove that any quasirandom dense large graph in which all degrees are equal and even can be decomposed into any given collection of two-factors (2-regular spanning subgraphs). A special case of this result gives a new solution to the Oberwolfach problem.
