Abstract
AbstractThe ‐color bipartite Ramsey number of a bipartite graph is the least integer for which every ‐edge‐colored complete bipartite graph contains a monochromatic copy of . The study of bipartite Ramsey numbers was initiated, over 40 years ago, by Faudree and Schelp and, independently, by Gyárfás and Lehel, who determined the 2‐color Ramsey number of paths. In this paper we determine asymptotically the 3‐color bipartite Ramsey number of paths and (even) cycles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have