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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gholami, Mostafa, Rowshan, Yaser
Format: Preprint
Veröffentlicht: 2021
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916139339087872
author Gholami, Mostafa
Rowshan, Yaser
author_facet Gholami, Mostafa
Rowshan, Yaser
contents 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 $1\leq i\leq t$. We compute the exact values of the bipartite Ramsey numbers $BR(C_8,C_{2n})$ for $n\geq2$.
format Preprint
id arxiv_https___arxiv_org_abs_2108_02630
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle The bipartite Ramsey numbers $BR(C_8, C_{2n})$
Gholami, Mostafa
Rowshan, Yaser
Combinatorics
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 $1\leq i\leq t$. We compute the exact values of the bipartite Ramsey numbers $BR(C_8,C_{2n})$ for $n\geq2$.
title The bipartite Ramsey numbers $BR(C_8, C_{2n})$
topic Combinatorics
url https://arxiv.org/abs/2108.02630