Discovery Projects - Grant ID: DP220102212

Funding Activity

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

Funding Status
Active

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 Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major breakthroughs in design theory concerning edge decompositions of dense hypergraphs.

Funded Activity Details

Start Date: 01-10-2022

End Date: 30-09-2025

Funding Scheme: Discovery Projects

Funding Amount: $325,000.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