{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:19:18Z","timestamp":1777562358716,"version":"3.51.4"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The k$-colour bipartite Ramsey number\u00a0of 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 over 40 years ago by Faudree and Schelp and, independently, by Gy\u00e1rf\u00e1s and Lehel, 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 DeBiasio, Gy\u00e1rf\u00e1s, Krueger, Ruszink\u00f3, and S\u00e1rk\u00f6zy, 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.<\/jats:p>","DOI":"10.37236\/8458","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T06:05:16Z","timestamp":1578636316000},"source":"Crossref","is-referenced-by-count":9,"title":["Multicolour Bipartite Ramsey Number of Paths"],"prefix":"10.37236","volume":"26","author":[{"given":"Matija","family":"Bucic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoham","family":"Letzter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2019,9,27]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i3p60\/7921","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i3p60\/7921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:08:20Z","timestamp":1579234100000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i3p60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,27]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/8458","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,27]]},"article-number":"P3.60"}}