{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:42:48Z","timestamp":1753893768376,"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>For given graphs $G_{1}, G_{2}, ... , G_{k}$, where $k \\geq 2$, the multicolor Ramsey number $R(G_{1}, G_{2}, ... , G_{k})$ is the smallest integer $n$ such that if we arbitrarily color the edges of the complete graph on $n$ vertices with $k$ colors, there is always a monochromatic copy of $G_{i}$ colored with $i$, for some $1 \\leq i \\leq k$. Let $P_k$ (resp. $C_k$) be the path (resp. cycle) on $k$ vertices. In the paper we show that $R(P_3,C_k,C_k)=R(C_k,C_k)=2k-1$ for odd $k$. In addition, we provide the exact values for Ramsey numbers $R(P_{4}, P_{4}, C_{k})=k+2$ and $R(P_{3}, P_{5}, C_{k})=k+1$.<\/jats:p>","DOI":"10.37236\/1081","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:59:42Z","timestamp":1578718782000},"source":"Crossref","is-referenced-by-count":8,"title":["On Some Ramsey and Tur\u00e1n-Type Numbers for Paths and Cycles"],"prefix":"10.37236","volume":"13","author":[{"given":"Tomasz","family":"Dzido","sequence":"first","affiliation":[]},{"given":"Marek","family":"Kubale","sequence":"additional","affiliation":[]},{"given":"Konrad","family":"Piwakowski","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2006,7,11]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r55\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r55\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:10:33Z","timestamp":1579320633000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v13i1r55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,11]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2006,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1081","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2006,7,11]]},"article-number":"R55"}}