English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Given bipartite graphs $H_1$, \dots , $H_k$, the bipartite Ramsey number$br(H_1,\dots, H_k)$ is the minimum integer $N$ such that any $k$-edge-coloringof complete bipartite graph $K_{N, N}$ contains a monochromatic $H_i$ in color$i$ for $1\le i\le k$. There are considerable results on asymptotic values ofbipartite Ramsey numbers of cycles. For exact value, Zhang-Sun \cite{Zhangs}determined $br(C_4, C_{2n})$, Zhang-Sun-Wu \cite{Zhangsw} determined $br(C_6,C_{2n})$, and Gholami-Rowshan \cite{GR} determined $br(C_8, C_{2n})$. In thispaper, we solve all remaining cases and give the exact values of $br(C_{2n},C_{2m})$ for all $n\ge m\ge 5$, this answers a question concerned byBuci\'c-Letzter-Sudakov \cite{BLS}, Gholami-Rowshan \cite{GR}, Zhang-Sun\cite{Zhangs}, and Zhang-Sun-Wu \cite{Zhangsw}.

The bipartite Ramsey number $br(C_{2n}, C_{2m})$