On Berge-Ramsey problems
From MaRDI portal
Publication:2185230
DOI10.37236/8775zbMath1441.05219arXiv1906.02465OpenAlexW3030658185MaRDI QIDQ2185230
Publication date: 4 June 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.02465
Related Items (6)
On Ramsey numbers of 3-uniform Berge cycles ⋮ On the cover Turán number of Berge hypergraphs ⋮ Exponential lower bound for Berge-Ramsey problems ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ On the cover Ramsey number of Berge hypergraphs ⋮ Multicolor Ramsey numbers for Berge cycles
Cites Work
- Unnamed Item
- Hypergraph extensions of the Erdős-Gallai theorem
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- General lemmas for Berge-Turán hypergraph problems
- Avoiding long Berge cycles
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Hypergraphs with No Cycle of a Given Length
- Ramsey Problems for Berge Hypergraphs
- Extremal Results for Berge Hypergraphs
- Some remarks on the theory of graphs
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
This page was built for publication: On Berge-Ramsey problems
