On non-degenerate Berge-Turán problems
From MaRDI portal
Publication:6131293
DOI10.1007/S00373-024-02757-WarXiv2301.01137MaRDI QIDQ6131293
Publication date: 4 April 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.01137
Cites Work
- Unnamed Item
- Supersaturated graphs and hypergraphs
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- General lemmas for Berge-Turán hypergraph problems
- Some sharp results on the generalized Turán numbers
- Some exact results for generalized Turán problems
- Avoiding long Berge cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- A survey of Turán problems for expansions
- Extremal Results for Berge Hypergraphs
- Many \(T\) copies in \(H\)-free graphs
- Generalized Turán results for intersecting cliques
This page was built for publication: On non-degenerate Berge-Turán problems