{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:07:17Z","timestamp":1760044037372,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We study the multicolor Ramsey numbers for paths and even cycles, $R_k(P_n)$ and $R_k(C_n)$, which are the smallest integers $N$ such that every coloring of the complete graph $K_N$ has a monochromatic copy of $P_n$ or $C_n$ respectively. For a long time, $R_k(P_n)$ has only been known to lie between $(k-1+o(1))n$ and $(k + o(1))n$. A recent breakthrough by S\u00e1rk\u00f6zy and later improvement by Davies, Jenssen and Roberts give an upper bound of $(k - \\frac{1}{4} + o(1))n$. We improve the upper bound to $(k - \\frac{1}{2}+ o(1))n$. Our approach uses structural insights in connected graphs without a large matching.<\/jats:p>","DOI":"10.37236\/7614","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:15:33Z","timestamp":1578640533000},"source":"Crossref","is-referenced-by-count":14,"title":["Improved Bounds on the Multicolor Ramsey Numbers of Paths and Even Cycles"],"prefix":"10.37236","volume":"26","author":[{"given":"Charlotte","family":"Knierim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2019,2,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p26\/7785","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p26\/7785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:18:05Z","timestamp":1579234685000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i1p26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,22]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,11]]}},"URL":"https:\/\/doi.org\/10.37236\/7614","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,2,22]]},"article-number":"P1.26"}}