Bipartite Ramsey numbers of cycles
From MaRDI portal
Publication:6201898
Recommendations
Cites work
- scientific article; zbMATH DE number 1186105 (Why is no real title available?)
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- 3-color bipartite Ramsey number of cycles and paths
- A Ramsey-type problem in directed and bipartite graphs
- A new upper bound for the bipartite Ramsey problem
- A partition calculus in set theory
- All Ramsey numbers for cycles in graphs
- An improvement on Łuczak's connected matchings method
- Bipartite Ramsey numbers for graphs of small bandwidth
- Cycles in bipartite graphs
- Edge condition for a Hamiltonian bipartite graph to be bipancyclic
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Exact bipartite Turán numbers of large even cycles
- Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
- Multicolour bipartite Ramsey number of paths
- On Hamiltonian bipartite graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Path-path Ramsey type numbers for the complete bipartite graph
- Ramsey numbers for cycles in graphs
- Some generalized bipartite Ramsey numbers involving short cycles
- The 3-colored Ramsey number of even cycles
- The Ramsey number for a triple of long even cycles
- The bipartite Ramsey numbers
- Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
Cited in
(4)
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)