Hypergraphs with infinitely many extremal constructions
From MaRDI portal
Publication:6401482
arXiv2206.03948MaRDI QIDQ6401482FDOQ6401482
Jianfeng Hou, Dhruv Mubayi, Heng Li, Xizhi Liu, Yixiao Zhang
Publication date: 8 June 2022
Abstract: We give the first exact and stability results for a hypergraph Tur'{a}n problem with infinitely many extremal constructions that are far from each other in edit-distance. This includes an example of triple systems with Tur'{a}n density , thus answering some questions posed by the third and fourth authors and Reiher about the feasible region of hypergraphs. Our results also provide extremal constructions whose shadow density is a transcendental number. Our novel approach is to construct certain multilinear polynomials that attain their maximum (in the standard simplex) on a line segment and then to use these polynomials to define an operation on hypergraphs that gives extremal constructions.
This page was built for publication: Hypergraphs with infinitely many extremal constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401482)
