The bipartite Ramsey numbers BR(C₈, C_{2n})

DOI10.46298/DMTCS.11207MaRDI QIDQ6507611arXivFDO

Authors M. Gholami, Yaser Rowshan

Published in arXiv

Full work available at URL https://doi.org/10.46298/DMTCS.11207

Abstract: For the given bipartite graphs $G_1,G_2,ldots,G_t$, the multicolor bipartite Ramsey number $BR(G_1,G_2,ldots,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 $1leqileqt$. We compute the exact values of the bipartite Ramsey numbers $BR(C_8,C_{2n})$ for $ngeq2$.

This page was built for publication: The bipartite Ramsey numbers $BR(C_8, C_{2n})$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507611)