Turán numbers for hypergraph star forests
From MaRDI portal
Publication:2122689
DOI10.1016/J.EJC.2022.103506zbMath1486.05145arXiv2001.05631OpenAlexW4210776651MaRDI QIDQ2122689
Publication date: 7 April 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.05631
Related Items (4)
Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications ⋮ Turán numbers of general star forests in hypergraphs ⋮ A note on stability results for Berge-\( K_{s , t}\) hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Hypergraphs with no cycle of length 4
- 3-uniform hypergraphs avoiding a given odd cycle
- Turán problems and shadows. I: Paths and cycles
- Rainbow Turán problems for paths and forests of stars
- On 3-uniform hypergraphs without a cycle of a given length
- Forbidden Berge hypergraphs
- Hypergraph extensions of the Erdős-Gallai theorem
- On hypergraphs of girth five
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- An Erdős-Gallai type theorem for uniform hypergraphs
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Cycles of even length in graphs
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- General lemmas for Berge-Turán hypergraph problems
- Turán numbers for Berge-hypergraphs and related extremal problems
- The shifting method and generalized Turán number of matchings
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Turán problems for disjoint copies of graphs
- Hypergraph Turán numbers of linear cycles
- Linear trees in uniform hypergraphs
- A hypergraph extension of Turán's theorem
- Hypergraphs with No Cycle of a Given Length
- Turán Numbers of Multiple Paths and Equibipartite Forests
- Turán Numbers for Forests of Paths in Hypergraphs
- On maximal paths and circuits of graphs
- Intersection Theorems for Systems of Sets
- Triangle-Free Hypergraphs
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Turán Problems and Shadows III: Expansions of Graphs
- Extremal Results for Berge Hypergraphs
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Turán numbers for hypergraph star forests
