A Hypergraph Turán Problem with No Stability
A Hypergraph Turán Problem with No Stability
复制标题
不稳定的超图图兰问题
DOI:
--
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
D. Mubayi
中科院分区:
文献类型:
--
作者:
Xizhi Liu;D. Mubayi
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án’s conjecture. Our main result is to construct a finite family of triple systems $${cal M}$$ ℳ , determine its Turán number, and prove that there are two near-extremal $${cal M}$$ ℳ -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.
DOI:
10.1016/j.jctb.2020.12.004
发表时间:
2021
期刊:
Series B
影响因子:
--
作者:
Liu, Xizhi;Mubayi, Dhruv
通讯作者:
Mubayi, Dhruv