Turán numbers for Berge-hypergraphs and related extremal problems
From MaRDI portal
Publication:1999723
DOI10.1016/j.disc.2019.02.003zbMath1414.05212arXiv1706.04249OpenAlexW2963547403MaRDI QIDQ1999723
Michael Tait, Craig Timmons, Cory Palmer, Adam Zsolt Wagner
Publication date: 27 June 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.04249
Related Items
Turán numbers for hypergraph star forests, Multicolor Turán numbers, A note on the Tur\'an number of a Berge odd cycle, 3-uniform hypergraphs without a cycle of length five, Counting hypergraphs with large girth, On Ramsey numbers of 3-uniform Berge cycles, The Turán Number of Berge K_4 in Triple Systems, On the cover Turán number of Berge hypergraphs, A note on saturation for Berge-\(G\) hypergraphs, Ramsey numbers of Berge-hypergraphs and related structures, Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs, Turán problems for Berge-\((k, p)\)-fan hypergraph, Ramsey Problems for Berge Hypergraphs, Hypergraph based Berge hypergraphs, Counting copies of a fixed subgraph in \(F\)-free graphs, On the cover Ramsey number of Berge hypergraphs, On the weight of Berge-\(F\)-free hypergraphs, The regularity method for graphs with few 4‐cycles
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
- Hypergraph extensions of the Erdős-Gallai theorem
- Pentagons vs. triangles
- On the number of graphs without 4-cycles
- Norm-graphs: Variations and applications
- Random Ramsey graphs for the four-cycle
- 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
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting independent sets in graphs
- On extremal problems of graphs and generalized graphs
- Hypergraph Turán numbers of linear cycles
- Linear trees in uniform hypergraphs
- Norm-graphs and bipartite Turán numbers
- A hypergraph extension of Turán's theorem
- The Maximum Number of Triangles in C2k+1-Free Graphs
- A survey of Turán problems for expansions
- Extremal subgraphs of random graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Turán Problems and Shadows III: Expansions of Graphs
- Extremal Results for Berge Hypergraphs
- Many \(T\) copies in \(H\)-free graphs
