Turán problems and shadows. II: Trees
From MaRDI portal
Publication:345098
DOI10.1016/j.jctb.2016.06.011zbMath1350.05113arXiv1402.0544OpenAlexW1648902078MaRDI QIDQ345098
Jacques Verstraete, Dhruv Mubayi, Alexandr V. Kostochka
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0544
Related Items
Turán numbers for hypergraph star forests, Extremal \(P_8\)-free/\(P_9\)-free planar graphs, Extremal Problems for Hypergraph Blowups of Trees, Linearity of saturation for Berge hypergraphs, Extremal Results for Berge Hypergraphs, A linear hypergraph extension of the bipartite Turán problem, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Turán numbers for Berge-hypergraphs and related extremal problems, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Hypergraphs Not Containing a Tight Tree with a Bounded Trunk, Turán Problems and Shadows III: Expansions of Graphs
Cites Work
- Unnamed Item
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Exact solution of some Turán-type problems
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Proof of a conjecture of Erdős on triangles in set-systems
- On extremal problems of graphs and generalized graphs
- Hypergraph Turán numbers of linear cycles
- Linear trees in uniform hypergraphs
- A hypergraph extension of Turán's theorem
- Intersection Theorems for Systems of Sets
- On families of finite sets no two of which intersect in a singleton
- A Combinatorial Theorem
