14
Sep
Thursday September 15, at 16:00
Room 300 in PPB (Physical Plant Building)
Oleg Pikhurko (CMU)
How to solve a hypergraph Turan problem exactly?
Abstract:
For a k-graph F, the Turan function ex(n,F) is the maximum size of an F-free k-graph on n vertices. In general, it is notoriously hard to determine. Even if we know ex(n,F) asymptotically, the exact computation might turn out to be a difficult task. I will discuss the stability approach for proving exact Turan results that was suggested by Simonovits in the 1960s and used recently by Furedi, Keevash, Mubayi, Sudakov, and others.
Some of the presented results are joint work with Dhruv Mubayi.
