{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:14:27Z","timestamp":1766049267568,"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>Given bipartite graphs $H_1$ and $H_2$, the bipartite Ramsey number $b(H_1; H_2)$ is the smallest integer $b$ such that any subgraph $G$ of the complete bipartite graph $K_{b,b}$, either $G$ contains a copy of $H_1$ or its complement relative to $K_{b,b}$ contains a copy of $H_2$. It is known that $b(K_{2,2};K_{2,2})=5, b(K_{2,3};K_{2,3})=9, b(K_{2,4};K_{2,4})=14$ and $b(K_{3,3};K_{3,3})=17$. In this paper we study the case $H_1$ being even cycles and $H_2$ being $K_{2,2}$, prove that $b(C_6;K_{2,2})=5$ and $b(C_{2m};K_{2,2})=m+1$ for $m\\geq 4$.<\/jats:p>","DOI":"10.37236\/538","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:52:54Z","timestamp":1578714774000},"source":"Crossref","is-referenced-by-count":5,"title":["The Bipartite Ramsey Numbers $b(C_{2m};K_{2,2})$"],"prefix":"10.37236","volume":"18","author":[{"given":"Zhang","family":"Rui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun","family":"Yongqi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,2,28]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p51\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p51\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:15:52Z","timestamp":1579302952000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,28]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/538","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,2,28]]},"article-number":"P51"}}