University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Hypergraphs with many extremal configurations

Hypergraphs with many extremal configurations

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.