Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium, Online/Virtual |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Since suggested by Tur\'an in 1941, determining the Tur\'an density of hypergraphs has been a notoriously difficult problem at the center of extremal combinatorics. Roughly speaking, the Tur\'an density $\pi(F)$ of a hypergraph $F$ is the threshold of the edge density above which large hypergraphs are guaranteed to contain a copy of $F$. Over the past decade, some progress was made in understanding the set of all Tur\'an densities, i.e., Π(k)={π(F):F is a k-uniform hypergraph},
as well as its variants. In this talk we discuss recent results and methods that are part of this development.
Based on joint works with Conlon; King and Sales; Li, Liu, and Sun; Liu, Wang, Yang, and Zhang; and Piga. No Notes/Supplements Uploaded No Video Files Uploaded