The bipartite Ramsey numbers $BR(C_8, C_{2n})$
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2024-02-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/11207/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849344610178957312 |
|---|---|
| author | Mostafa Gholami Yaser Rowshan |
| author_facet | Mostafa Gholami Yaser Rowshan |
| author_sort | Mostafa Gholami |
| collection | DOAJ |
| description | 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 | Article |
| id | doaj-art-e39c27e9be374668ae3bd1295fea19d6 |
| institution | Kabale University |
| issn | 1365-8050 |
| language | English |
| publishDate | 2024-02-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj-art-e39c27e9be374668ae3bd1295fea19d62025-08-20T03:42:37ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502024-02-01vol. 25:2Graph Theory10.46298/dmtcs.1120711207The bipartite Ramsey numbers $BR(C_8, C_{2n})$Mostafa GholamiYaser RowshanFor 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$.http://dmtcs.episciences.org/11207/pdfmathematics - combinatorics |
| spellingShingle | Mostafa Gholami Yaser Rowshan The bipartite Ramsey numbers $BR(C_8, C_{2n})$ Discrete Mathematics & Theoretical Computer Science mathematics - combinatorics |
| title | The bipartite Ramsey numbers $BR(C_8, C_{2n})$ |
| title_full | The bipartite Ramsey numbers $BR(C_8, C_{2n})$ |
| title_fullStr | The bipartite Ramsey numbers $BR(C_8, C_{2n})$ |
| title_full_unstemmed | The bipartite Ramsey numbers $BR(C_8, C_{2n})$ |
| title_short | The bipartite Ramsey numbers $BR(C_8, C_{2n})$ |
| title_sort | bipartite ramsey numbers br c 8 c 2n |
| topic | mathematics - combinatorics |
| url | http://dmtcs.episciences.org/11207/pdf |
| work_keys_str_mv | AT mostafagholami thebipartiteramseynumbersbrc8c2n AT yaserrowshan thebipartiteramseynumbersbrc8c2n AT mostafagholami bipartiteramseynumbersbrc8c2n AT yaserrowshan bipartiteramseynumbersbrc8c2n |