Science· Leipzig
Turán problems in the uniform setting
This event covers Turán-type extremal problems in combinatorics, focusing on questions about uniform hypergraphs—specifically, determining how many edges a k-uniform hypergraph can have while avoiding certain forbidden substructures, a central and largely open area of extremal graph theory.