UVictoria Discrete Math Seminar: Dylan King

The Turan density of a forbidden hypergraph F is the largest edge density a large hypergraph H can have without containing any copy of F, and determining this number for various F is a notoriously difficult problem. One on-ramp to this question (from Erdos and Sos) is to furthermore require that the hyperedges of H are distributed nearly uniformly across the vertices, giving the uniform Turan density of F. All known examples of such uniformly dense H avoiding some F follow the so-called “palette” construction of Rodl. In this talk we will introduce each of these notions before discussing our main result, that any palette can be obtained as an extremal construction for some finite family of forbidden subgraph F, which will require the tools of hypergraph regularity and Lagrangians. As an application we can obtain some (interesting) new values as the uniform Turan density of forbidden families.

Based on joint work with Simon Piga, Marcelo Sales, and Bjarne Schuelke.