Turán Problems and Shadows III: Expansions of Graphs
From MaRDI portal
Publication:5254084
DOI10.1137/140977138zbMath1314.05142arXiv1407.2588OpenAlexW2056655718MaRDI QIDQ5254084
Jacques Verstraete, Dhruv Mubayi, Alexandr V. Kostochka
Publication date: 8 June 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.2588
Related Items (13)
Turán numbers for hypergraph star forests ⋮ Simplicial homeomorphs and trace-bounded hypergraphs ⋮ Linearity of saturation for Berge hypergraphs ⋮ Induced Turán problems and traces of 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 ⋮ Forbidden Berge hypergraphs ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs
Cites Work
- Turán problems and shadows. II: Trees
- 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
- A homological approach to two problems on finite sets
- Norm-graphs: Variations and applications
- A hypergraph extension of the bipartite Turán problem
- 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
- 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 FINITE SETS
- On families of finite sets no two of which intersect in a singleton
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Turán Problems and Shadows III: Expansions of Graphs
