University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Turan densities for daisies and hypercubes

Turan densities for daisies and hypercubes

Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

OOEW04 - Structure and Randomness - a celebration of the mathematics of Timothy Gowers

The Turan problem for hypercubes asks: how few vertices of the n-dimensional cube can we take so that they meet every d-dimensional subcube? A longstanding conjecture states that the best one can do (asymptotically) is 1/(d+1) of all vertices, by taking every (d+1)th layer of the cube. In this talk we will explain the connection to Turan questions for`daisy’ hypergraphs, and present a disproof of the conjecture. This is joint work with David Ellis and Maria Ivan.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity