当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The generalised Oberwolfach problem
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2021-10-21 , DOI: 10.1016/j.jctb.2021.09.007 Peter Keevash , Katherine Staden
中文翻译:
广义 Oberwolfach 问题
更新日期:2021-10-22
Journal of Combinatorial Theory Series B ( IF 1.4 ) Pub Date : 2021-10-21 , DOI: 10.1016/j.jctb.2021.09.007 Peter Keevash , Katherine Staden
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.
中文翻译:
广义 Oberwolfach 问题
我们证明了所有度相等甚至偶数的任何准随机密集大图都可以分解为任何给定的二因子集合(2-正则生成子图)。这个结果的一个特例为 Oberwolfach 问题提供了一个新的解决方案。