Multicolored Bipartite Ramsey Numbers of Large Cycles
From MaRDI portal
Publication:6489811
DOI10.1007/S10255-024-1118-3MaRDI QIDQ6489811
Publication date: 22 April 2024
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Cites Work
- Unnamed Item
- The bipartite Ramsey numbers
- On the multi-colored Ramsey numbers of paths and even cycles
- The Ramsey number for a triple of long even cycles
- The 3-colored Ramsey number of even cycles
- Highly connected coloured subgraphs via the regularity Lemma
- All Ramsey numbers for cycles in graphs
- Path-path Ramsey type numbers for the complete bipartite graph
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Bipartite Ramsey numbers and Zarankiewicz numbers
- Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors
- Bipartite Ramsey numbers for graphs of small bandwidth
- The Ramsey numbers for a triple of long cycles
- Some generalized bipartite Ramsey numbers involving short cycles
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Multicolour Ramsey numbers of paths and even cycles
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Recent developments in graph Ramsey theory
- 3‐Color bipartite Ramsey number of cycles and paths
- Three‐colored asymmetric bipartite Ramsey number of connected matchings and cycles
This page was built for publication: Multicolored Bipartite Ramsey Numbers of Large Cycles