ARC Future Fellowships - Grant ID: FT130100464

Funding Activity

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

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

Graph colouring via entropy compression. Graphs and hypergraphs are mathematical structures that model networks. Colouring graphs and hypergraphs is a key problem in many fields including scheduling, computing derivatives, cryptography, and coding theory. This project will apply a revolutionary method called "entropy compression" to produce new mathematical tools and algorithms for colouring graphs and hypergraphs. These results will have significant ramifications for the above applications, and will also be of fundamental importance in graph theory itself.

Funded Activity Details

Start Date: 01-01-2014

End Date: 31-12-2017

Funding Scheme: ARC Future Fellowships

Funding Amount: $721,210.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