The Oberwolfach Problem and related Graph Factorisations

图分解是组合数学中一个活跃的研究领域，它是由理论问题和新的和不同的应用驱动的，特别是在数字通信和信息技术方面。这个项目的目的是解决Oberwolfach问题：一个基本的和具有历史意义的图分解问题，几十年来一直吸引着研究人员。建立在最近的突破，新的和广泛适用的图分解技术打算被开发。预计项目成果将对该领域的研究产生持续的影响和影响。

Graph factorisation is an active area of research in combinatorial mathematics that is driven both by theoretical questions and by new and varied applications, particularly in digital communication and information technologies. The aim of this project is to solve the Oberwolfach Problem: a fundamental and historically significant graph factorisation question that has intrigued researchers for decades. Building on recent breakthroughs, new and widely applicable graph factorisation techniques are intended to be developed. The project outcomes are expected to have ongoing influence and impact on research in the field.