A hypergraph Turán problem with no stability
From MaRDI portal
Publication:2095110
DOI10.1007/s00493-021-4561-2OpenAlexW4213296153MaRDI QIDQ2095110
Publication date: 9 November 2022
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07969
combinatorial theoryedge densitystability theoremextremal hypergraph theoryTurán densityTurán's conjecturefundamental barrierhypergraph family
Related Items (2)
Stability theorems for some Kruskal-Katona type results ⋮ A unified approach to hypergraph stability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On possible Turán densities
- A new generalization of Mantel's theorem to \(k\)-graphs
- An exact Turán result for the generalized triangle
- A class of constructions for Turan's (3,4)-problem
- An upper bound for the Turán number \(t_3(n,4)\)
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- What we know and what we do not know about Turán numbers
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- The feasible region of hypergraphs
- The Turán number of the Fano plane
- On a hypergraph Turán problem of Frankl
- A hypergraph extension of Turán's theorem
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Structure and stability of triangle-free set systems
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Triple Systems Not Containing a Fano Configuration
- On Triple Systems with Independent Neighbourhoods
This page was built for publication: A hypergraph Turán problem with no stability