Turán numbers of general star forests in hypergraphs
From MaRDI portal
Publication:6635085
DOI10.1016/J.DISC.2024.114219MaRDI QIDQ6635085
Ligong Wang, Linpeng Zhang, Hajo Broersma
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turán problems and shadows. II: Trees
- On the Turán number of forests
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Vraagstuk XXVIII.
- 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
- The generalized Turán number of spanning linear forests
- Turán numbers for hypergraph star forests
- Generalized Turán number for linear forests
- The shifting method and generalized Turán number of matchings
- Hypergraph Turán numbers of linear cycles
- Linear trees in uniform hypergraphs
- A hypergraph extension of Turán's theorem
- Eine Extremalaufgabe aus der Graphentheorie.
- Some exact results of the generalized Turán numbers for paths
- Turán Numbers for Forests of Paths in Hypergraphs
- Turán Problems and Shadows III: Expansions of Graphs
- Extremal Results for Berge Hypergraphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Turán numbers of general star forests in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635085)
