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 atten

Description

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.. Scheme: Discovery Projects. Field: 0101 - Pure Mathematics. Lead: A/Prof Daniel Horsley