Factorisations of graphs (2013–2015)

This project lies at the interface of graph theory and combinatorial design theory and addresses several open problems on factorisations of graphs. Graph factorisations play roles in many diverse situations and applications including fields such as scheduling, communications, data storage and security. The long-standing open problems under investigation include a 47 year old conjecture on perfect 1-factorisations and a 45 year old problem on factorisations into isomorphic 2-factors. The project will enhance Australia's position at the forefront of research in discrete mathematics, as well as providing valuable training to postgraduates in the use of new techniques in this field.
Grant type:
ARC Discovery Projects
Funded by:
Australian Research Council