General lemmas for Berge-Turán hypergraph problems
From MaRDI portal
Publication:1987076
DOI10.1016/j.ejc.2020.103082zbMath1437.05172arXiv1808.10842OpenAlexW3002121530WikidataQ124913668 ScholiaQ124913668MaRDI QIDQ1987076
Cory Palmer, Abhishek Methuku, Dániel Gerbner
Publication date: 9 April 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10842
Related Items (31)
Turán numbers for hypergraph star forests ⋮ The Turán number of Berge-matching in hypergraphs ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ On Berge-Ramsey problems ⋮ The Turán number of Berge hypergraphs with stable properties ⋮ On non-degenerate Berge-Turán problems ⋮ Turán numbers of Berge trees ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ The Turán Number of Berge-$K_4$ in 3-Uniform Hypergraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ On the cover Turán number of Berge hypergraphs ⋮ Saturation of Berge hypergraphs ⋮ Ramsey numbers of Berge-hypergraphs and related structures ⋮ Connected hypergraphs without long Berge-paths ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ Avoiding long Berge cycles ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ Multicolor Ramsey numbers for Berge cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3-uniform hypergraphs avoiding a given odd cycle
- On 3-uniform hypergraphs without a cycle of a given length
- Hypergraph extensions of the Erdős-Gallai theorem
- On a class of degenerate extremal graph problems
- An Erdős-Gallai type theorem for uniform hypergraphs
- Cycles of even length in graphs
- New asymptotics for bipartite Turán numbers
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- Avoiding long Berge cycles
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Turán numbers of complete 3-uniform Berge-hypergraphs
- A hypergraph extension of Turán's theorem
- A survey of Turán problems for expansions
- On maximal paths and circuits of graphs
- Graphs with few paths of prescribed length between any two vertices
- Hypergraphs with Few Berge Paths of Fixed Length between Vertices
- Extremal Results for Berge Hypergraphs
- 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: General lemmas for Berge-Turán hypergraph problems
