A hypergraph Tur\'{a}n problem with no stability

DOI10.1007/S00493-021-4561-2arXiv1911.07969MaRDI QIDQ6329434FDOQ6329434

Authors: Xizhi Liu, Dhruv Mubayi 

Publication date: 18 November 2019

Abstract: A fundamental barrier in extremal hypergraph theory is the presence of many near-extremal constructions with very different structures. Indeed, the classical constructions due to Kostochka imply that the notorious extremal problem for the tetrahedron exhibits this phenomenon assuming Tur'an's conjecture. Our main result is to construct a finite family of triple systems $mathcalM$, determine its Tur'{a}n number, and prove that there are two near-extremal $mathcalM$-free constructions that are far from each other in edit-distance. This is the first extremal result for a hypergraph family that fails to have a corresponding stability theorem.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

This page was built for publication: A hypergraph Tur\'{a}n problem with no stability

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