The Oberwolfach Problem and related Graph Factorisations (2015–2018)

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 will be developed. The project outcomes will have ongoing influence and impact on research in the field.
Grant type:
ARC Discovery Projects
Funded by:
Australian Research Council