Multicolour bipartite Ramsey number of paths (Q2325761): Difference between revisions

Summary: The \(k\)-colour bipartite Ramsey number of a bipartite graph \(H\) is the least integer \(N\) for which every \(k\)-edge-coloured complete bipartite graph \(K_{N,N}\) contains a monochromatic copy of \(H\). The study of bipartite Ramsey numbers was initiated by \textit{R. J. Faudree} and \textit{R. H. Schelp} [Discrete Math. 8, 313--329 (1974; Zbl 0294.05122)] and, independently, by \textit{A. Gyarfas} and \textit{J. Lehel} [Period. Math. Hung. 3, 299--304 (1973; Zbl 0267.05115)], who determined the \(2\)-colour bipartite Ramsey number of paths. Recently the \(3\)-colour Ramsey number of paths and (even) cycles, was essentially determined as well. Improving the results of \textit{L. DeBiasio} et al. [``Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs'', Preprint, \url{arXiv:1804.04195}], in this paper we determine asymptotically the \(4\)-colour bipartite Ramsey number of paths and cycles. We also provide new upper bounds on the \(k\)-colour bipartite Ramsey numbers of paths and cycles which are close to being tight.