Discovery Projects - Grant ID: DP150100530

Funding Activity

Website
http://dataportal.arc.gov.au/NCGP/Web/Grant/Grant/DP150100530

Funding Status
Closed

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

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.

Funded Activity Details

Start Date: 01-01-2015

End Date: 31-12-2018

Funding Scheme: Discovery Projects

Funding Amount: $316,700.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) | Pure Mathematics |

ANZSRC Socio-Economic Objective (SEO)

Expanding Knowledge in the Mathematical Sciences

Other Keywords

Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) | Expanding Knowledge in the Mathematical Sciences | Pure Mathematics

Related Links