On Ramsey numbers of 3-uniform Berge cycles
From MaRDI portal
Publication:6197744
DOI10.1016/j.disc.2024.113877arXiv2204.12840MaRDI QIDQ6197744
Leila Maherani, Maryam Shahsiah
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.12840
Hypergraphs (05C65) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- Hypergraph extensions of the Erdős-Gallai theorem
- An Erdős-Gallai type theorem for uniform hypergraphs
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- General lemmas for Berge-Turán hypergraph problems
- Turán numbers for Berge-hypergraphs and related extremal problems
- Exponential lower bound for Berge-Ramsey problems
- On Berge-Ramsey problems
- Ramsey numbers of Berge-hypergraphs and related structures
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
- Turán numbers of complete 3-uniform Berge-hypergraphs
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Hypergraphs with No Cycle of a Given Length
- The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
- Triangle-Free Hypergraphs
- The Turán Number of Berge K_4 in Triple Systems
- Ramsey Problems for Berge Hypergraphs
- Extremal Results for Berge Hypergraphs
- A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
This page was built for publication: On Ramsey numbers of 3-uniform Berge cycles
