Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
From MaRDI portal
Publication:5918876
DOI10.1016/j.ejc.2020.103109zbMath1442.05146OpenAlexW3012956141MaRDI QIDQ5918876
Abhishek Methuku, Casey Tompkins, Dániel Grósz
Publication date: 16 June 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103109
Related Items (10)
Turán numbers for hypergraph star forests ⋮ The Turán number of Berge-matching in hypergraphs ⋮ A note on the uniformity threshold for Berge hypergraphs ⋮ 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 the cover Turán number of Berge hypergraphs ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Hypergraph based Berge hypergraphs
Cites Work
- 3-uniform hypergraphs avoiding a given odd cycle
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On hypergraphs of girth five
- Some extremal results on complete degenerate hypergraphs
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- Turán numbers for Berge-hypergraphs and related extremal problems
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Hypergraph Extensions of the Erdős-Gallai Theorem
- Triangle-Free Hypergraphs
- Ramsey numbers for graphs with five vertices
- Extremal Results for Berge Hypergraphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
