Hypergraphs with many extremal configurations

Add to your list(s) Download to your calendar using vCal

• Christian Reiher (Hamburg)
• Thursday 22 April 2021, 16:00-17:00
• https://bham-ac-uk.zoom.us/j/86238837160.

If you have a question about this talk, please contact M.Jenssen.

For every positive integer $t$ we construct a finite family of triple systems $M_t$, determine its Tur\’{a}n number, and show that there are $t$ extremal $M_t$-free configurations that are far from each other in edit-distance.

We also prove a strong stability theorem: every $M_t$-free triple system whose size is close to the maximum size is a subgraph of one of these $t$ extremal configurations after removing a small proportion of vertices.

This is joint work with Xizhi Liu and Dhruv Mubayi.

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• https://bham-ac-uk.zoom.us/j/86238837160
• Combinatorics and Probability seminar
• School of Mathematics events

Note that ex-directory lists are not shown.