The Oberwolfach Problem and related Graph Factorisations

点击翻译按钮获取中文摘要

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.