Turán problems in the uniform setting

• 📅Do, 12. Nov 2026
• 📍Bibliothek des Max-Planck-Institut für Mathematik in den Naturwissenschaften — Alle Events

This talk surveys recent breakthroughs in uniform Turán density problems for hypergraphs, highlighting the regularity-based approach of Reiher, Rödl, and Schacht and Lamaison's palette construction results. It concludes with a recent theorem confirming that Rödl's 1986 lower bound construction is optimal in the Tetrahedron case.