The bipartite Ramsey numbers $BR(C_8,C_{2n})$

Abstract

For the given bipartite graphs $G_1,G_2,\dots ,G_t$, the multicolor bipartite Ramsey number $BR(G_1,G_2,\dots ,G_t)$ is the smallest positive integer $b$ such that any $t$-edge-coloring of $K_{b,b}$ contains a monochromatic subgraph isomorphic to $G_i$, colored with the $i$th color for some $1\le i\le t$. We compute the exact values of the bipartite Ramsey numbers $BR(C_8,C_{2n})$ for $n\ge 2$.

Cited by in corpus (2)

• The Multipartite Ramsey numbers $m_j(n{K}_2,C_7)$
• The Multipartite Ramsey numbers $m_j(C_3,C_m,n_1{K}_2,n_2{K}_2,\dots ,n_i{K}_2)$