Ramsey Numbers for Nontrivial Berge Cycles
From MaRDI portal
Publication:5020835
DOI10.1137/21M1396770zbMath1480.05128arXiv2102.03720OpenAlexW4206495143MaRDI QIDQ5020835
Publication date: 7 January 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.03720
Hypergraphs (05C65) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of \(C_{2\ell}\)-free graphs
- 3-uniform hypergraphs avoiding a given odd cycle
- Turán problems and shadows. I: Paths and cycles
- Pentagons vs. triangles
- A note on the independence number of triangle-free graphs
- A note on Ramsey numbers
- New upper bounds on the order of cages
- On hypergraphs of girth five
- Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
- Compactness results in extremal graph theory
- Rainbow Turán problem for even cycles
- Hypergraph Ramsey numbers: triangles versus cliques
- Hypergraph Turán numbers of linear cycles
- Hypergraphs with no odd cycle of given length
- Extremal problems for cycles in graphs
- A survey of Turán problems for expansions
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- The Ramsey number R(3, t) has order of magnitude t2/log t
- The Ramsey number of loose cycles versus cliques
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- Dynamic concentration of the triangle-free process
- Minimal Regular Graphs of Girths Eight and Twelve
- A note on odd cycle-complete graph Ramsey numbers
This page was built for publication: Ramsey Numbers for Nontrivial Berge Cycles
