Decompositions of graphs into cycles: Alspach's Conjecture and the Oberwolfach Problem. (2012–2015)

Graph decomposition is an active area of research at the junction of the mathematical fields of graph theory and design theory. It is driven both by theoretical questions and by new and varied applications, particularly in digital communication and information technologies. This project will capitalise on recent breakthroughs of the Chief Investigator to solve two fundamental and long-standing open problems concerning graph decompositions. These two problems are historically significant, have intrigued researchers in the area for decades, and have inspired many new lines of research. New widely applicable graph decomposition techniques will be developed that will influence research in the area for many years to come.
Grant type:
ARC Discovery Projects
Funded by:
Australian Research Council