{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:34Z","timestamp":1753893814502,"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 finite family of graphs $G_{1}, G_{2}, \\ldots , G_{k}, k \\geq 2$, the multicolor Ramsey number $R(G_{1}, G_{2}, \\ldots , 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 then there is always a monochromatic copy of $G_{i}$ colored with $i$, for some $1 \\leq i \\leq k$.  We give a lower bound for $k-$color Ramsey number $R(C_{m}, C_{m}, \\ldots , C_{m})$, where $m \\geq 4$ is even and $C_{m}$ is the cycle on $m$ vertices.<\/jats:p>","DOI":"10.37236\/1980","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:09:59Z","timestamp":1578719399000},"source":"Crossref","is-referenced-by-count":2,"title":["New Lower Bound for Multicolor Ramsey Numbers for Even Cycles"],"prefix":"10.37236","volume":"12","author":[{"given":"Tomasz","family":"Dzido","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Nowik","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Szuca","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2005,8,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v12i1n13\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v12i1n13\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:47:41Z","timestamp":1579322861000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v12i1n13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8,30]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2005,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1980","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2005,8,30]]},"article-number":"N13"}}