{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:22:22Z","timestamp":1759335742141,"version":"3.41.2"},"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 size-Ramsey number $\\hat{R}(F,r)$ of a graph $F$ is the smallest integer $m$ such that there exists a graph $G$ on $m$ edges with the property that any colouring of the edges of $G$ with $r$ colours yields a monochromatic copy of $F$. In this short note, we give an alternative proof of the recent result of Krivelevich that $\\hat{R}(P_n,r) = O((\\log r)r^2 n)$. This upper bound is nearly optimal, since it is also known that $\\hat{R}(P_n,r) = \\Omega(r^2 n)$.<\/jats:p>","DOI":"10.37236\/7954","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:10:36Z","timestamp":1578669036000},"source":"Crossref","is-referenced-by-count":5,"title":["Note on the Multicolour Size-Ramsey Number for Paths,"],"prefix":"10.37236","volume":"25","author":[{"given":"Andrzej","family":"Dudek","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,8,24]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p35\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i3p35\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:26:41Z","timestamp":1579235201000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i3p35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,24]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,7,12]]}},"URL":"https:\/\/doi.org\/10.37236\/7954","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,8,24]]},"article-number":"P3.35"}}