Hypergraphs with many extremal configurations

MaRDI QIDQ6359742zbMATH OpenFDO

Authors Xizhi Liu, Dhruv Mubayi, Christian Reiher

Publication date 3 February 2021

Abstract: For every positive integer $t$ we construct a finite family of triple systems ${mathcalM}_t$, determine its Tur'{a}n number, and show that there are $t$ extremal ${mathcalM}_t$-free configurations that are far from each other in edit-distance. We also prove a strong stability theorem: every ${mathcalM}_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 the first stability theorem for a hypergraph problem with an arbitrary (finite) number of extremal configurations. Moreover, the extremal hypergraphs have very different shadow sizes (unlike the case of the famous Tur'an tetrahedron conjecture). Hence a corollary of our main result is that the boundary of the feasible region of ${mathcalM}_t$ has exactly $t$ global maxima.

This page was built for publication: Hypergraphs with many extremal configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6359742)