On some three color ramsey numbers for paths, cycles, stripes and stars
Farideh Khoeini , Tomasz Dzido
AbstractFor given graphs G1,G2,...,Gk, k≥2, the multicolor Ramsey number R(G1,G2,...,Gk) is the smallest integern such that if we arbitrarily color the edges of the complete graph of ordern with k colors, then it contains a monochromatic copy of Gi in color i, for some 1≤i≤k. The main result of the paper is a theorem which establishes the connection between the multicolor Ramsey number and the appropriate multicolor bipartite Ramsey number together with the ordinary Ramseynumber. The remaining part of the paper consists of a number of corollaries which are derived from the main result and from known results for Ramsey numbers and bipartite Ramsey numbers. We provide some new exact values or generalize known results for multicolor Ramsey numbers of paths, cycles, stripes and stars versus other graphs.
|Journal series||Graphs and Combinatorics, ISSN 0911-0119, (A 20 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||Ramsey number, bipartite Ramsey number, cycle, path, stripe, star|
|License||Other; published final; ; with publication|
|Score|| = 20.0, ArticleFromJournal|
= 20.0, ArticleFromJournal
|Publication indicators||: 2017 = 1.002; : 2017 = 0.481 (2) - 2017=0.599 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.