Bipartite Ramsey numbers of cycles
From MaRDI portal
Publication:6201898
DOI10.1016/J.EJC.2024.103921OpenAlexW4390802235MaRDI QIDQ6201898FDOQ6201898
Authors: Zilong Yan, Yuejian Peng 
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2024.103921
Cites Work
- The 3-colored Ramsey number of even cycles
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- The Ramsey number for a triple of long even cycles
- All Ramsey numbers for cycles in graphs
- A Ramsey-type problem in directed and bipartite graphs
- Cycles in bipartite graphs
- A partition calculus in set theory
- A new upper bound for the bipartite Ramsey problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- On Hamiltonian bipartite graphs
- Exact bipartite Turán numbers of large even cycles
- The bipartite Ramsey numbers
- Edge condition for a Hamiltonian bipartite graph to be bipancyclic
- 3‐Color bipartite Ramsey number of cycles and paths
- Path-path Ramsey type numbers for the complete bipartite graph
- Some generalized bipartite Ramsey numbers involving short cycles
- Bipartite Ramsey numbers for graphs of small bandwidth
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
- Multicolour bipartite Ramsey number of paths
- Three‐colored asymmetric bipartite Ramsey number of connected matchings and cycles
- An improvement on Łuczak's connected matchings method
Cited In (1)
This page was built for publication: Bipartite Ramsey numbers of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201898)
