{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:22Z","timestamp":1753893862112,"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>Let $G_1, G_2, G_3, \\ldots , G_t$ be graphs. The multicolor Ramsey number $R(G_1, G_2, \\ldots, G_t)$ is the smallest positive integer $n$ such that if the edges of a complete graph $K_n$ are partitioned into $t$ disjoint color classes giving $t$ graphs $H_1,H_2,\\ldots,H_t$, then at least one $H_i$ has a subgraph isomorphic to $G_i$. In this paper, we provide the exact value of $R(P_{n_1}, P_{n_2},\\ldots, P_{n_t},C_k)$ for certain values of $n_i$ and $k$. In addition, the exact values of $R(P_5,C_4,P_k)$, $R(P_4,C_4,P_k)$, $R(P_5,P_5,P_k)$ and $R(P_5,P_6,P_k)$ are given. Finally, we give a lower bound for $R(P_{2n_1}, P_{2n_2},\\ldots, P_{2n_t})$ and we conjecture that this lower bound is the exact value of this number. Moreover, some evidence is given for this conjecture.<\/jats:p>","DOI":"10.37236\/511","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:56:48Z","timestamp":1578715008000},"source":"Crossref","is-referenced-by-count":3,"title":["On Multicolor Ramsey Number of Paths Versus Cycles"],"prefix":"10.37236","volume":"18","author":[{"given":"Gholam Reza","family":"Omidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghaffar","family":"Raeisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,1,26]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p24\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p24\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:17:36Z","timestamp":1579303056000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/511","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,1,26]]},"article-number":"P24"}}