On non-degenerate Turán problems for expansions
From MaRDI portal
Publication:6655693
DOI10.1016/J.EJC.2024.104071MaRDI QIDQ6655693FDOQ6655693
Authors: Dániel Gerbner
Publication date: 27 December 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of linear graphs
- A hypergraph extension of Turán's theorem
- Title not available (Why is that?)
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Turán Problems and Shadows III: Expansions of Graphs
- Extremal results for Berge hypergraphs
- Many \(T\) copies in \(H\)-free graphs
- Turán numbers for Berge-hypergraphs and related extremal problems
- A survey of Turán problems for expansions
- Some sharp results on the generalized Turán numbers
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Eine Extremalaufgabe aus der Graphentheorie.
- Induced Turán problems and traces of hypergraphs
- Some exact results for non-degenerate generalized Turán problems
- On non-degenerate Berge-Turán problems
Cited In (1)
This page was built for publication: On non-degenerate Turán problems for expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655693)