The Turán number of Berge hypergraphs with stable properties
From MaRDI portal
Publication:6056469
Recommendations
- A hypergraph Turán problem with no stability
- Stability from graph symmetrization arguments in generalized Turán problems
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- A note on stability results for Berge-\( K_{s , t}\) hypergraphs
- A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
Cites work
- A method in graph theory
- A variation of a theorem by Pósa
- Counting copies of a fixed subgraph in F-free graphs
- Extremal results for Berge hypergraphs
- General lemmas for Berge-Turán hypergraph problems
- scientific article; zbMATH DE number 3215865 (Why is no real title available?)
- Many \(T\) copies in \(H\)-free graphs
- Maximizing the number of cliques in graphs with given matching number
- The formula for Turán number of spanning linear forests
- The generalized Turán number of spanning linear forests
- The Turán Number of Berge K₄ in Triple Systems
- The Turán number of Berge-K₄ in 3-uniform hypergraphs
- The Turán number of Berge-matching in hypergraphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
Cited in
(3)
This page was built for publication: The Turán number of Berge hypergraphs with stable properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056469)