A hypergraph Turán problem with no stability
Let \(\mathcal{F}\) be a family of \(r\)-uniform hypergraphs (henceforth \(r\)-graphs), for \(r\geq 3\). An \(r\)-graph \(\mathcal{H}\) is \(\mathcal{F}\)-free if no member of \(\mathcal{F}\) is a subgraph of \(\mathcal{H}\). The Turán number \({\text{ex}}(n, \mathcal{F})\) of \(\mathcal{F}\) is the maximum number of edges in an \(\mathcal{F}\)-free \(r\)-graph on \(n\) vertices, and the Turán density \(\pi(\mathcal{F})\) of \(\mathcal{F}\) is \(\pi(\mathcal{F}) :=\lim_{n\to \infty} {\text{ex}}(n, \mathcal{F})/{n \choose r}\). The \textit{stability of} the family \(\mathcal{F}\) is the property (informally) that there is a unique \(\mathcal{F}\)-free \(r\)-graph \(\mathcal{G}\) on \(n\) vertices with \({\text{ex}}(n, \mathcal{F})\) edges, and moreover, any \(\mathcal{F}\)-free \(r\)-graph with number of edges \textit{close} to \({\text{ex}}(n,\mathcal{F})\) can be transformed to \(\mathcal{G}\) by deleting and adding \textit{few} edges only.\par The paper describes a family of \(3\)-graphs \(\mathcal{M}\) such that there are two near-extremal \(\mathcal{M}\)-free \(3\)-graphs that are far from each other. Moreover, the paper determines the Turán density and the Turán number of \(\mathcal{M}\). \(\mathcal{M}\) is the first known family not having the stability property for which the Turán number is known.
- A class of constructions for Turan's (3,4)-problem
- A hypergraph extension of Turán's theorem
- A new generalization of Mantel's theorem to \(k\)-graphs
- An exact Turán result for the generalized triangle
- An upper bound for the Turán number \(t_3(n,4)\)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 4200246 (Why is no real title available?)
- scientific article; zbMATH DE number 3966110 (Why is no real title available?)
- scientific article; zbMATH DE number 4101239 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On 3-hypergraphs with forbidden 4-vertex configurations
- On a hypergraph Turán problem of Frankl
- On possible Turán densities
- On Triple Systems with Independent Neighbourhoods
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Structure and stability of triangle-free set systems
- The feasible region of hypergraphs
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
- What we know and what we do not know about Turán numbers
- A unified approach to hypergraph stability
- Stability theorems for some Kruskal-Katona type results
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- Turán problems on non-uniform hypergraphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- The Turán number of Berge hypergraphs with stable properties
- A 2-stable family of triple systems
- A hypergraph Tur\'{a}n problem with no stability
- Non-degenerate hypergraphs with exponentially many extremal constructions
- Two stability theorems for \(\mathcal{K}_{\ell + 1}^r\)-saturated hypergraphs
- Hypergraphs with many extremal configurations
- A criterion for Andrásfai-Erdős-Sós type theorems and applications
This page was built for publication: A hypergraph Turán problem with no stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095110)
